Bounds for Binary Codes With Narrow Distance Distributions
From MaRDI portal
Publication:3549013
DOI10.1109/TIT.2007.901192zbMATH Open1325.94169MaRDI QIDQ3549013FDOQ3549013
Authors: Ron M. Roth, Gadiel Seroussi 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- Upper bounds on the cardinality of a binary code with a given minimum distance
- Estimates of the distance distribution of codes and designs
- Estimates of the distance distribution of codes and designs
- Bounds for binary codes of length less than 25
- Binomial moments of the distance distribution: bounds and applications
Cited In (19)
- Two new bounds on the size of binary codes with a minimum distance of three
- On the distance distribution of codes
- A limit law on the distance distribution of binary codes
- Bounds on sets with few distances
- Linear codes and character sums
- VC bounds on the cardinality of nearly orthogonal function classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the VC-dimension of binary codes
- On the size of maximal binary codes with 2, 3, and 4 distances
- Upper bounds on the cardinality of a binary code with a given minimum distance
- On Bounded-Weight Error-Correcting Codes
- Estimates of the distance distribution of nonbinary codes, with applications
- Bounds on distance distributions in codes of given size
- Bounds on Distance Distributions in Codes of Known Size
- The Closest Pair Problem under the Hamming Metric
- Title not available (Why is that?)
- Title not available (Why is that?)
- On equidistant constant weight codes
This page was built for publication: Bounds for Binary Codes With Narrow Distance Distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549013)
