Linear codes with large automorphism groups are constructed. Most of them are suitable for permutation decoding. In some cases they are also optimal. For instance, we construct an optimal binary code of length (Formula presented.) and dimension (Formula presented.) having minimum distance (Formula presented.) and automorphism group isomorphic to (Formula presented.).
On linear codes admitting large automorphism groups
SONNINO, Angelo
2017-01-01
Abstract
Linear codes with large automorphism groups are constructed. Most of them are suitable for permutation decoding. In some cases they are also optimal. For instance, we construct an optimal binary code of length (Formula presented.) and dimension (Formula presented.) having minimum distance (Formula presented.) and automorphism group isomorphic to (Formula presented.).File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
DCC_83.pdf
non disponibili
Descrizione: DCC 83
Tipologia:
Documento in Post-print
Licenza:
DRM non definito
Dimensione
523.89 kB
Formato
Adobe PDF
|
523.89 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
