Binomial moments of the distance distribution: bounds and applications
From MaRDI portal
Publication:4701293
DOI10.1109/18.748994zbMATH Open0946.94028OpenAlexW2112090436MaRDI QIDQ4701293FDOQ4701293
Alexander Barg, Alexei Ashikhmin
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.748994
Recommendations
linear programminglower boundsasymptotic analysisbinomial momentsdistance distributionprobability of undetected error for binary codes
Cited In (9)
- STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES
- Estimates of the distance distribution of codes and designs
- Undetected error probability of \(q\)-ary constant weight codes
- Binomial moments of the distance distribution and the probability of undetected error.
- Title not available (Why is that?)
- On the probability of undetected error for binary codes used for combined correction and detection
- Extended binomial moments of a linear code and the undetected error probability
- Energy bounds for codes and designs in Hamming spaces
- A survey on proper codes
This page was built for publication: Binomial moments of the distance distribution: bounds and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701293)