Optimal Linear Codes From Matrix Groups
From MaRDI portal
Recommendations
Cited in
(19)- Construction of binary and ternary self-orthogonal linear codes
- Optimal binary constant weight codes and affine linear groups over finite fields
- On the existence of PD-sets: algorithms arising from automorphism groups of codes
- On the classification of unitals on 28 points of low rank
- Search for combinatorial objects using lattice algorithms -- revisited
- New linear codes with prescribed group of automorphisms found by heuristic search
- Alcuni aspetti della struttura formale dei codici lineari
- On strongly walk regular graphs, triple sum sets and their codes
- q-analogs of packing designs
- Update on the Extension of Good Linear Codes
- Construction of Linear Codes With Large Minimum Distance
- scientific article; zbMATH DE number 1498791 (Why is no real title available?)
- On linear codes admitting large automorphism groups
- On the non-existence of a projective \((75, 4, 12, 5)\) set in \(\mathrm{PG}(3, 7)\)
- Affine blocking sets, three-dimensional codes and the Griesmer bound
- Some high-rate linear codes over \(\text{GF}(5)\) and \(\text{GF}(7)\)
- Some constructions of linearly optimal group codes
- Constructing two-weight codes with prescribed groups of automorphisms
- \((l,s)\)-extension of linear codes
This page was built for publication: Optimal Linear Codes From Matrix Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546610)
