Classifying subspaces of Hamming spaces

DOI10.1023/A:1019903407222MaRDI QIDQ1866022zbMATH OpenOpenAlexFDO

Authors Patric R. J. Östergård

Publication date 3 April 2003

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019903407222

zbMATH Keywords

automorphism groupcode equivalencelinear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Review text

The author classifies low length linear codes by computer via reduction to graph isomorphism.

Cited in

(17)

• Edge local complementation and equivalence of binary linear codes
• Random generation of linear codes.
• New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4)
• Binary optimal linear rate 1/2 codes
• Quantum stabilizer codes, lattices, and CFTs
• Additive Toeplitz codes over \(\mathbb{F}_4\)
• Linear codes with covering radius 3
• Directed graph representation of half-rate additive codes over \(\text{GF}(4)\)
• On the binary projective codes with dimension 6
• Two new four-error-correcting binary codes
• Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: a coding-theoretic approach
• Classification and Galois conjugacy of Hamming maps
• On a Gröbner bases structure associated to linear codes
• scientific article; zbMATH DE number 524148 (Why is no real title available?)
• scientific article; zbMATH DE number 6123029 (Why is no real title available?)
• Computer classification of linear codes based on lattice point enumeration
• Binary formally self-dual odd codes

Describes a project that uses

Uses Software

• nauty

This page was built for publication: Classifying subspaces of Hamming spaces

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