Minimum distance and convergence analysis of hamming-accumulate-acccumulate codes - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Communications Année : 2009

Minimum distance and convergence analysis of hamming-accumulate-acccumulate codes

Alexandre Graell I Amat
  • Fonction : Auteur
  • PersonId : 865933
Raphaël Le Bidan

Résumé

In this letter we consider the ensemble of codes formed by the serial concatenation of a Hamming code and two accumulate codes. We show that this ensemble is asymptotically good, in the sense that most codes in the ensemble have minimum distance growing linearly with the block length. Thus, the resulting codes achieve high minimum distances with high probability, about half or more of the minimum distance of a typical random linear code of the same rate and length in our examples. The proposed codes also show reasonably good iterative convergence thresholds, which makes them attractive for applications requiring high code rates and low error rates, such as optical communications and magnetic recording.
Fichier non déposé

Dates et versions

hal-00445503 , version 1 (08-01-2010)

Identifiants

Citer

Alexandre Graell I Amat, Raphaël Le Bidan. Minimum distance and convergence analysis of hamming-accumulate-acccumulate codes. IEEE Transactions on Communications, 2009, 57 (12), pp.3518-3523. ⟨10.1109/TCOMM.2009.12.080579⟩. ⟨hal-00445503⟩
8 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More