The asymptotic behaviour of diameters in the average
From MaRDI portal
Publication:1333337
DOI10.1006/JCTB.1994.1042zbMath0813.90131OpenAlexW2091236548MaRDI QIDQ1333337
Publication date: 17 May 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1994.1042
Related Items (7)
Models of multi-user write-efficient memories and general diametric theorems ⋮ On the minimum average distance of binary constant weight codes ⋮ On the variance of average distance of subsets in the Hamming space ⋮ On the minimum average distance of binary codes: Linear programming approach ⋮ AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES ⋮ Lower bounds on the minimum average distance of binary codes ⋮ On the average Hamming distance for binary codes
This page was built for publication: The asymptotic behaviour of diameters in the average
