The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
From MaRDI portal
Cites work
- A Bound for Error-Correcting Codes
- A new class of nonbinary codes meeting the Griesmer bound
- A note on the Griesmer bound (Corresp.)
- Algebraically punctured cyclic codes
- Binary codes with improved minimum weights (Corresp.)
- scientific article; zbMATH DE number 3663006 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- On quasi-cyclic codes with rate l m (Corresp.)
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
- Shortened BCH codes (Corresp.)
Cited in
(14)- An improvement of the Griesmer bound for some small minimum distances
- A note on the covering radius of optimum codes
- Optimal ternary quasi-cyclic codes
- Optimal ternary linear codes
- On the \([28,7,12]\) binary self-complementary codes and their residuals
- Optimal linear codes over \(\mathrm{GF}(4)\)
- The \([46, 9, 20]_2\) code is unique
- On the nonexistence of ternary linear codes attaining the Griesmer bound
- On the binary projective codes with dimension 6
- A conjecture on the minimum length of linear codes over finite fields
- Binary self-orthogonal codes which meet the Griesmer bound or have optimal minimum distances
- Divisibility of Griesmer codes
- On the minimum length of binary linear codes
- Bounds on the dimension of codes and subcodes with prescribed contraction index
This page was built for publication: The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1151870)
