Bounds on Distance Distributions in Codes of Known Size
DOI10.1109/TIT.2004.839479zbMATH Open1247.94069MaRDI QIDQ3546504FDOQ3546504
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)
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
upper boundBeckner inequalityundetected error probabilitydistance distributions of codeslower bound on the error-probability thresholdupper estimates on the covering radius
Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cited In (9)
- Estimates of the distance distribution of codes and designs
- Distance Distribution in Reed-Solomon Codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
