A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code
From MaRDI portal
Publication:3798598
DOI10.1109/18.2646zbMath0652.94019OpenAlexW2049211654MaRDI QIDQ3798598
W. J. van Gils, L. M. G. M. Tolhuizen
Publication date: 1988
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.2646
Related Items
On linear codes admitting large automorphism groups ⋮ Transitive \(\mathrm{PSL}(2,11)\)-invariant \(k\)-arcs in \(\mathrm{PG}(4,q)\) ⋮ Linear codes resulting from finite group actions ⋮ On the existence of PD-sets: algorithms arising from automorphism groups of codes