On the binary projective codes with dimension 6

DOI10.1016/j.dam.2006.03.004zbMath1096.94035OpenAlexW1981053622MaRDI QIDQ2499590

Iliya G. Bouyukliev

Publication date: 14 August 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.004

zbMATH Keywords

automorphism groupself-orthogonal codescode equivalencecanonical labelling

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22)

Related Items (3)

Self-orthogonal codes from the strongly regular graphs on up to 40 vertices ⋮ On the Construction of Binary Optimal LCD Codes with Short Length ⋮ An Enumeration of Certain Projective Ternary Two-Weight Codes

Cites Work

• Unnamed Item
• Unnamed Item
• Classification of some optimal ternary linear codes of small length
• The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
• The \([18,9,6\) code is unique]
• Uniqueness of some linear subcodes of the extended binary Golay code
• An orderly algorithm and some applications in finite geometry
• Optimal binary linear codes of dimension at most seven
• Classifying subspaces of Hamming spaces
• The uniformly packed binary \([27, 21, 3 \) and \([35, 29, 3 ]\) codes]
• The \([23,14,5\) Wagner code is unique]
• Classification and constructions of complete caps in binary spaces
• Binary even [25,15,6 codes do not exist (Corresp.)]
• Isomorph-Free Exhaustive Generation
• The smallest length of eight-dimensional binary linear codes with prescribed minimum distance
• A note on the Griesmer bound (Corresp.)

This page was built for publication: On the binary projective codes with dimension 6