Minimum possible block length of a linear binary code for some distances
From MaRDI portal
Recommendations
- Minimum block length of a linear q-ary code with specified dimension and code distance
- scientific article; zbMATH DE number 702178
- New bounds for the minimum length of binary linear block codes
- On the minimum length of some linear codes
- A new lower bound on the minimal length of a binary linear code
- scientific article; zbMATH DE number 729918
- Binary linear codes with near-extremal maximum distance
- On the minimum average distance of binary codes: Linear programming approach
- A note on the minimal binary linear code
- Upper bounds on the cardinality of a binary code with a given minimum distance
Cited in
(11)- An improvement of Griesmer bound for some classes of distances
- scientific article; zbMATH DE number 702178 (Why is no real title available?)
- Divisibility of codes meeting the Griesmer bound
- Three best binary linear block codes of minimum distance fifteen
- Classification of Griesmer codes and dual transform
- Structure of functional codes defined on non-degenerate Hermitian varieties
- A note on the covering radius of optimum codes
- Minimum block length of a linear q-ary code with specified dimension and code distance
- Hamming distances of constacyclic codes of length 3p^s and optimal codes with respect to the Griesmer and Singleton bounds
- New bounds for the minimum length of binary linear block codes
- An improvement of the Griesmer bound for some small minimum distances
This page was built for publication: Minimum possible block length of a linear binary code for some distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798611)
