All binary linear codes that are invariant under 2(n)
Abstract
The projective special linear group 2(n) is 2-transitive for all primes n and 3-homogeneous for n 3 4 on the set \0,1, ·s, n-1, ∞\. It is known that the extended odd-like quadratic residue codes are invariant under 2(n). Hence, the extended quadratic residue codes hold an infinite family of 2-designs for primes n 1 4, an infinite family of 3-designs for primes n 3 4. To construct more t-designs with t ∈ \2, 3\, one would search for other extended cyclic codes over finite fields that are invariant under the action of 2(n). 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 2(n).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.