THE CONCATENATED STRUCTURE OF QUASI-ABELIAN CODES - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Designs, Codes and Cryptography Année : 2021

THE CONCATENATED STRUCTURE OF QUASI-ABELIAN CODES

Cem Güneri
  • Fonction : Auteur
  • PersonId : 906424
Patrick Solé
  • Fonction : Auteur
  • PersonId : 1110391

Résumé

The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Solé, (2001)). We give a concatenated decomposition of quasi-abelian codes and show, as in the quasi-cyclic case, that the two decompositions are equivalent. The concatenated decomposition allows us to give a general minimum distance bound for quasi-abelian codes and to construct some optimal codes. Moreover, we show by examples that the minimum distance bound is sharp in some cases. In addition, examples of large strictly quasi-abelian codes of about a half rate are given. The concatenated structure also enables us to conclude that strictly quasi-abelian linear complementary dual codes over any finite field are asymptotically good.
Fichier principal
Vignette du fichier
1807.01246.pdf (192.65 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03346416 , version 1 (16-09-2021)

Identifiants

Citer

Martino Borello, Cem Güneri, Elif Saçikara, Patrick Solé. THE CONCATENATED STRUCTURE OF QUASI-ABELIAN CODES. Designs, Codes and Cryptography, 2021, ⟨10.1007/s10623-021-00921-4⟩. ⟨hal-03346416⟩
58 Consultations
105 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More