On the binary projective codes with dimension 6
From MaRDI portal
Cites work
- A note on the Griesmer bound (Corresp.)
- An orderly algorithm and some applications in finite geometry
- Binary even [25,15,6] codes do not exist (Corresp.)
- Classification and constructions of complete caps in binary spaces
- Classification of some optimal ternary linear codes of small length
- Classifying subspaces of Hamming spaces
- scientific article; zbMATH DE number 4208000 (Why is no real title available?)
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- Isomorph-Free Exhaustive Generation
- Optimal binary linear codes of dimension at most seven
- The \([18,9,6]\) code is unique
- The \([23,14,5]\) Wagner code is unique
- The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
- The smallest length of eight-dimensional binary linear codes with prescribed minimum distance
- The uniformly packed binary \([27, 21, 3 ]\) and \([35, 29, 3 ]\) codes
- Uniqueness of some linear subcodes of the extended binary Golay code
Cited in
(6)- \(G\)-projectable and \(\Lambda\)-projectable binary linear block codes
- An enumeration of certain projective ternary two-weight codes
- Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
- On the construction of binary optimal LCD codes with short length
- On the least covering radius of binary linear codes of dimension 6
- On subspace codes
This page was built for publication: On the binary projective codes with dimension 6
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2499590)
