Pages that link to "Item:Q3798598"
From MaRDI portal
The following pages link to A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code (Q3798598):
Displaying 4 items.
- On linear codes admitting large automorphism groups (Q517270) (← links)
- Transitive \(\mathrm{PSL}(2,11)\)-invariant \(k\)-arcs in \(\mathrm{PG}(4,q)\) (Q1999905) (← links)
- On the existence of PD-sets: algorithms arising from automorphism groups of codes (Q2025365) (← links)
- Linear codes resulting from finite group actions (Q5104012) (← links)