On the minimum average distance of binary constant weight codes

DOI10.1016/J.DISC.2007.07.081MaRDI QIDQ932637zbMATH OpenOpenAlexFDO

Authors Fangwei Fu, Yong Jiang, Shutaong Xia

Publication date 11 July 2008

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.07.081

zbMATH Keywords

linear programmingJohnson schemedistance distributionbinary constant weight codesaverage distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• 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 minimum average distance of binary codes: Linear programming approach
• On the maximum cardinality of binary constant weight codes with prescribed distance
• A relation between the average Hamming distance and the average Hamming weight of binary codes

Cites work

• scientific article; zbMATH DE number 4074964 (Why is no real title available?)
• scientific article; zbMATH DE number 3543912 (Why is no real title available?)
• scientific article; zbMATH DE number 1286502 (Why is no real title available?)
• scientific article; zbMATH DE number 1159111 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A relation between the average Hamming distance and the average Hamming weight of binary codes
• An ``average distance inequality for large subsets of the cube
• Association schemes and coding theory
• Coding for write-efficient memory
• Contributions to the geometry of Hamming spaces
• Minimum average distance subsets in the Hamming cube
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• On the Hamming distance between two i.i.d. random n-tuples over a finite set
• On the average Hamming distance for binary codes
• On the expectation and variance of Hamming distance between two i. i. d. random vectors
• On the minimum average distance of binary codes: Linear programming approach
• The Probability of Undetected Error for Binary Constant-Weight Codes
• The asymptotic behaviour of diameters in the average

Cited in

(8)

• Graph theoretic methods in coding theory
• Lower bounds on the minimum average distance of binary codes
• An average weight-distance enumerator for binary expansions of Reed-Solomon codes
• The Minimum Average Code for Finite Memoryless Monotone Sources
• 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
• 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: On the minimum average distance of binary constant weight codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932637)