Bounds on Distance Distributions in Codes of Known Size

DOI10.1109/TIT.2004.839479MaRDI QIDQ3546504zbMATH OpenFDO

Authors Alexei Ashikhmin, Michael Krivelevich, Gérard Cohen, Simon Litsyn

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

upper boundBeckner inequalityundetected error probabilitydistance distributions of codeslower bound on the error-probability thresholdupper estimates on the covering radius

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Bounds on distance distributions in codes of given size
• Estimates of the distance distribution of codes and designs
• Estimates of the distance distribution of codes and designs
• Bounds for Binary Codes With Narrow Distance Distributions
• Binomial moments of the distance distribution: bounds and applications

Cited in

(9)

• Estimates of the distance distribution of codes and designs
• Distance Distribution in Reed-Solomon Codes
• scientific article; zbMATH DE number 4018402 (Why is no real title available?)
• scientific article; zbMATH DE number 4150083 (Why is no real title available?)
• Estimates of the distance distribution of codes and designs
• Distance properties of expander codes
• Estimates of the distance distribution of nonbinary codes, with applications
• Bounds on distance distributions in codes of given size
• New bounds on the distance distribution of extended Goppa codes

This page was built for publication: Bounds on Distance Distributions in Codes of Known Size

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