The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
From MaRDI portal
Publication:1151870
DOI10.1016/0012-365X(81)90166-7zbMath0458.94037OpenAlexW2117555509WikidataQ127932661 ScholiaQ127932661MaRDI QIDQ1151870
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(81)90166-7
Related Items
On the nonexistence of ternary linear codes attaining the Griesmer bound ⋮ 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 binary projective codes with dimension 6 ⋮ The \([46, 9, 20_2\) code is unique] ⋮ Bounds on the dimension of codes and subcodes with prescribed contraction index ⋮ On the \([28,7,12\) binary self-complementary codes and their residuals] ⋮ Optimal linear codes over \(\mathrm{GF}(4)\)
Cites Work
- Unnamed Item
- Unnamed Item
- A new class of nonbinary codes meeting the Griesmer bound
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
- Binary codes with improved minimum weights (Corresp.)
- On quasi-cyclic codes with rate l m (Corresp.)
- Shortened BCH codes (Corresp.)
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
- A note on the Griesmer bound (Corresp.)
