An improvement of the Griesmer bound for some small minimum distances
From MaRDI portal
Publication:1083427
DOI10.1016/0166-218X(85)90064-2zbMath0603.94011OpenAlexW1979986081MaRDI QIDQ1083427
Nikolai L. Manev, Stefan Dodunekov
Publication date: 1985
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(85)90064-2
Related Items (3)
A note on the covering radius of optimum codes ⋮ The \([18,9,6\) code is unique] ⋮ Support weight enumerators and coset weight distributions of isodual codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum possible block length of a linear binary code for some distances
- The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
- New constructions of codes meeting the Griesmer bound
- Design Methods for Maximum Minimum-Distance Error-Correcting Codes
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
- A new class of codes meeting the Griesmer bound
- A characterization of codes meeting the Griesmer bound
- Binary codes with improved minimum weights (Corresp.)
- On quasi-cyclic codes with rate l m (Corresp.)
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
- Minimum-distance bounds for binary linear codes
This page was built for publication: An improvement of the Griesmer bound for some small minimum distances
