On the existence of PD-sets: algorithms arising from automorphism groups of codes
From MaRDI portal
Publication:2025365
DOI10.3934/amc.2020065zbMath1464.94074OpenAlexW2998801137MaRDI QIDQ2025365
Publication date: 12 May 2021
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020065
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Linear codes (general theory) (94B05) Decoding (94B35)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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)\)
- Binary codes and partial permutation decoding sets from the Johnson graphs
- On linear codes admitting large automorphism groups
- Codes from lattice and related graphs, and permutation decoding
- Codes associated with triangular graphs and permutation decoding
- Linear codes arising from the Gale transform of distinguished subsets of some projective spaces
- Finite geometry and the Gale transform
- Binary codes from rectangular lattice graphs and permutation decoding
- Permutation decoding for binary codes from lattice graphs
- 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
- 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
- The Pace code, the Mathieu group \(M_{12}\) and the small Witt design \(S(5, 6, 12)\)
- Codes associated with circulant graphs and permutation decoding
- 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)\)
- Information sets and partial permutation decoding for codes from finite geometries
- Linear codes with given automorphism groups
- PD-sets for the codes related to some classical varieties
- Codes related to line graphs of triangular graphs and permutation decoding
- On Small Complete Arcs and Transitive A5-Invariant Arcs in the Projective Plane PG(2,q)
- Optimal Linear Codes From Matrix Groups
- A Geometric Construction of a $[110,5,90_{9}$-Linear Code Admitting the Mathieu Group $M_{11}$]
- A permutation decoding of the (24, 12, 8) Golay code (Corresp.)
- 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 abelian codes
- Permutation Decoding of Systematic Codes
