Repeat-accumulate-accumulate (RAA) code[1] 

Description

Generalization of the RA code in which two accumulators and permutations are used.

Rate

Some sequences of non-deterministic RAA codes are asymptotically good [1,2].

Encoding

An encoder for an RAA code is the same as that for the RA code, followed by a second round of permutation and acumulation.

Parent

Child

References

[1]
L. Bazzi, M. Mahdian, and D. A. Spielman, “The Minimum Distance of Turbo-Like Codes”, IEEE Transactions on Information Theory 55, 6 (2009) DOI
[2]
V. Guruswami and W. Machmouchi, “Explicit interleavers for a Repeat Accumulate Accumulate (RAA) code construction”, 2008 IEEE International Symposium on Information Theory (2008) DOI
[3]
D. Divsalar, S. Dolinar, J. Thorpe, and C. Jones, “Constructing LDPC codes from simple loop-free encoding modules”, IEEE International Conference on Communications, 2005. ICC 2005. 2005 DOI
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)— see instructions

edit on this site

Zoo Code ID: raa

Cite as:
“Repeat-accumulate-accumulate (RAA) code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/raa
BibTeX:
@incollection{eczoo_raa, title={Repeat-accumulate-accumulate (RAA) code}, booktitle={The Error Correction Zoo}, year={2023}, editor={Albert, Victor V. and Faist, Philippe}, url={https://errorcorrectionzoo.org/c/raa} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/raa

Cite as:

“Repeat-accumulate-accumulate (RAA) code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/raa

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/classical/bits/tanner/irregular/ra/raa.yml.