New bounds on binary linear codes of dimension eight (Corresp.)

DOI10.1109/TIT.1987.1057363MaRDI QIDQ3780992zbMATHOpenAlexFDO

Authors Tor Helleseth, Øyvind Ytrehus, Stefan Dodunekov, Nikolai L. Manev

Publication date 1987

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.1987.1057363

zbMATH Keywords

minimum distanceoptimal codesGriesmer boundbinary linear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• scientific article; zbMATH DE number 1188987
• New linear codes over GF(8)
• On optimal linear codes over \(\mathbb F_8\)
• scientific article; zbMATH DE number 2154115
• Improved bounds for ternary linear codes of dimension 8 using tabu search
• Results on Binary Linear Codes With Minimum Distance 8 and 10
• On the rank of \(\mathbb{Z}_8\)-linear Hadamard codes
• New quasi-cyclic degenerate linear codes over GF(8)
• scientific article; zbMATH DE number 2188463
• Linear codes with eight weights over \(\mathbb{F}_p+u\mathbb{F}_p\)

Cited in

(7)

• A characterization of some \(\{v_ 2+2v_ 3,v_ 1+2v_ 2;k-1,3\}\)-minihypers and some \((v_ k-30,k,3^{k-1}-21;3)\)-codes meeting the Griesmer bound
• Some bounds for the minimum length of binary linear codes of dimension nine
• A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
• Optimal ternary quasi-cyclic codes
• Optimal ternary linear codes
• On optimal linear codes over \(\mathbb F_8\)
• On the maximum length of coil-in-the-box codes in dimension 8

This page was built for publication: New bounds on binary linear codes of dimension eight (Corresp.)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780992)