Bounds for Binary Codes With Narrow Distance Distributions
From MaRDI portal
Publication:3549013
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)- The Closest Pair Problem under the Hamming Metric
- Estimates of the distance distribution of nonbinary codes, with applications
- On the VC-dimension of binary codes
- Bounds on distance distributions in codes of given size
- scientific article; zbMATH DE number 3478749 (Why is no real title available?)
- VC bounds on the cardinality of nearly orthogonal function classes
- A limit law on the distance distribution of binary codes
- On the size of maximal binary codes with 2, 3, and 4 distances
- scientific article; zbMATH DE number 4150083 (Why is no real title available?)
- scientific article; zbMATH DE number 4218374 (Why is no real title available?)
- Bounds on Distance Distributions in Codes of Known Size
- On equidistant constant weight codes
- Upper bounds on the cardinality of a binary code with a given minimum distance
- On the distance distribution of codes
- On Bounded-Weight Error-Correcting Codes
- Bounds on sets with few distances
- Two new bounds on the size of binary codes with a minimum distance of three
- Linear codes and character sums
- scientific article; zbMATH DE number 1972784 (Why is no real title available?)
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)
