Computer Science – Information Theory
Scientific paper
2009-05-28
Computer Science
Information Theory
To appear in IEEE Transactions on Communications
Scientific paper
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.
Amat Alexandre Graell i.
Bidan Raphael Le
No associations
LandOfFree
Minimum Distance and Convergence Analysis of Hamming-Accumulate-Acccumulate Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Minimum Distance and Convergence Analysis of Hamming-Accumulate-Acccumulate Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum Distance and Convergence Analysis of Hamming-Accumulate-Acccumulate Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-293170