All Binary Linear Codes That Are Invariant Under <inline-formula> <tex-math notation="LaTeX">{\mathrm{PSL}}_2(n) </tex-math> </inline-formula>
From MaRDI portal
Publication:4682876
Abstract: The projective special linear group is -transitive for all primes and -homogeneous for on the set . It is known that the extended odd-like quadratic residue codes are invariant under . Hence, the extended quadratic residue codes hold an infinite family of -designs for primes , an infinite family of -designs for primes . To construct more -designs with , one would search for other extended cyclic codes over finite fields that are invariant under the action of . The objective of this paper is to prove that the extended quadratic residue binary codes are the only nontrivial extended binary cyclic codes that are invariant under .
Recommendations
- Polynomial invariants for binary linear codes
- Z/sub 2/k-linear codes
- Codes Z2k-linéaires
- A family of binary codes from \(\mathbb Z_{2^k}\)-linear codes
- scientific article; zbMATH DE number 5043457
- Some results on the existence of binary linear codes (Corresp.)
- Equivalences among \(\mathbb{Z}_{2^s} \)-linear Hadamard codes
- Z(p/sup k+1/)-linear codes
- Linearity and classification of \(\mathbb{Z}_p \mathbb{Z}_{p^2} \)-linear generalized Hadamard codes
- On linear codes over \(\mathbb Z_2\)
This page was built for publication: All Binary Linear Codes That Are Invariant Under <inline-formula> <tex-math notation="LaTeX">${\mathrm{PSL}}_2(n)$ </tex-math> </inline-formula>
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682876)