Title :
Repeat-accumulate codes that approach the Gilbert-Varshamov bound
Author :
Brown, Andrew ; Luby, Michael ; Shokrollahi, Amin
Author_Institution :
EPFL, Lausanne
Abstract :
We show, using a probabilistic argument, that for any y with 0 < y < 1 there exist repeat-accumulate codes that approach the asymptotic Gilbert-Varshamov bound, and that are encodable in time O(n 1+y)
Keywords :
decoding; encoding; asymptotic Gilbert-Varshamov bound; erasure channel; graph based codes; repeat-accumulate codes; Algorithm design and analysis; Channel capacity; Decoding; Eigenvalues and eigenfunctions; Encoding; Entropy; Random sequences;
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
DOI :
10.1109/ISIT.2005.1523316
