On linear codes admitting large automorphism groups

DOI10.1007/s10623-016-0207-6zbMath1368.51011MaRDI QIDQ517270

Nicola Pace, Angelo Sonnino

Publication date: 23 March 2017

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

Full work available at URL: https://doi.org/10.1007/s10623-016-0207-6

zbMATH Keywords

automorphism; projective space; linear code; matrix group; permutation decoding

Mathematics Subject Classification ID

20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures

51E22: Linear codes and caps in Galois spaces

94B35: Decoding

Related Items

Transitive \(\mathrm{PSL}(2,11)\)-invariant \(k\)-arcs in \(\mathrm{PG}(4,q)\), On the existence of PD-sets: algorithms arising from automorphism groups of codes, \(s\)-PD-sets for codes from projective planes \(\mathrm{PG}(2,2^h)\), \(5\leq h\leq 9\)

Uses Software

• Magma
• ATLAS Group Representations
• Code Tables

Cites Work

• Partial permutation decoding for simplex codes
• New ternary linear codes from projectivity groups
• 42-arcs in \(\mathrm{PG}(2, q)\) left invariant by \(\mathrm{PSL}(2, 7)\)
• Linear codes arising from the Gale transform of distinguished subsets of some projective spaces
• Finite geometry and the Gale transform
• Self-orthogonal designs and codes from the symplectic groups S\(_4\)(3) and S\(_4\)(4)
• Infinite family of large complete arcs in PG\((2, q ^{n })\), with \(q\) odd and \(n > 1\) odd
• Constructing two-weight codes with prescribed groups of automorphisms
• Construction of binary and ternary self-orthogonal linear codes
• Codes with prescribed permutation group
• t-designs on hypergraphs
• The Magma algebra system. I: The user language
• Permutation decoding for the binary codes from triangular graphs.
• Partial permutation decoding for codes from finite planes
• Transitive \(A_6\)-invariant \(k\)-arcs in \(\mathrm{PG}(2,q)\)
• Transitive \(\mathrm{PSL}(2,7)\)-invariant 42-arcs in 3-dimensional projective spaces
• On the codes related to the Higman-Sims graph
• New linear codes with prescribed group of automorphisms found by heuristic search
• Antiblocking systems and PD-sets
• PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of \(\mathrm{PG}(5,2)\)
• On the simple group of D.G. Higman and C.C. Sims
• A simple group of order 44,352,000
• Linear codes with given automorphism groups
• PD-sets for the codes related to some classical varieties
• An Enumeration of Certain Projective Ternary Two-Weight Codes
• On Small Complete Arcs and Transitive A5-Invariant Arcs in the Projective Plane PG(2,q)
• Optimal Linear Codes From Matrix Groups
• A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• Permutation Decoding of Systematic Codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item