Lower bounds on the minimum average distance of binary codes
\textit{R. Ahlswede} and \textit{G. O. H. Katona} [Discrete Math. 17, 1--22 (1977; Zbl 0368.05001)] posed the following problem: For given \(n\) and \(M\) with \(1 \leq M \leq 2^n\), determine the minimum average Hamming distance \(\beta (n,M)\) of binary codes with length \(n\) and size \(M\). In graph-theoretic terms, this is the minimum average distance between \(M\) vertices of the \(n\)-cube. A linear programming approach is here used to derive new lower bounds on \(\beta (n,M)\), leading among other things to the result that \(\lim_{n \rightarrow \infty} \beta (n,2n) = 5/2\).
- On the minimum average distance of binary codes: Linear programming approach
- Minimum average distance subsets in the Hamming cube
- On the minimum average distance of binary constant weight codes
- Further results on the asymptotic behaviour of minimum average Hamming distance for binary codes
- Average distance and minimum average distance of binary constant weight code and its properties
- An ``average distance inequality for large subsets of the cube
- Bounds for binary codes of length less than 25
- Contributions to the geometry of Hamming spaces
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Minimum average distance subsets in the Hamming cube
- On shortest cocycle covers of graphs
- On the average Hamming distance for binary codes
- On the minimum average distance of binary codes: Linear programming approach
- Survey of binary Krawtchouk polynomials
- The asymptotic behaviour of diameters in the average
- On the average Hamming distance for binary codes
- The asymptotic behaviour of diameters in the average
- Minimum average distance subsets in the Hamming cube
- Sets of binary sequences with small total Hamming distances
- Lower bounds on the minimum distance of long codes in the Lee metric
- Further results on the asymptotic behaviour of minimum average Hamming distance for binary codes
- Average distance and minimum average distance of binary constant weight code and its properties
- The Minimum Average Code for Finite Memoryless Monotone Sources
- On the minimum average distance of binary codes: Linear programming approach
- On the minimum average distance of binary constant weight codes
This page was built for publication: Lower bounds on the minimum average distance of binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998361)
