AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES

DOI10.1142/S1793830910000723zbMath1201.94119OpenAlexW1971944323MaRDI QIDQ3063606

Bandhu Prasad, Manjusri Basu

Publication date: 15 December 2010

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830910000723

zbMATH Keywords

Hamming distanceHamming weightdistance distributionaverage distancebinary constant codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• An ``average distance inequality for large subsets of the cube
• On the minimum average distance of binary constant weight codes
• Coding for write-efficient memory
• Contributions to the geometry of Hamming spaces
• The asymptotic behaviour of diameters in the average
• On the expectation and variance of Hamming distance between two i. i. d. random vectors
• Minimum average distance subsets in the Hamming cube
• The Probability of Undetected Error for Binary Constant-Weight Codes
• A relation between the average Hamming distance and the average Hamming weight of binary codes
• On the minimum average distance of binary codes: Linear programming approach

This page was built for publication: AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES