Computer Science – Information Theory
Scientific paper
2005-09-15
Computer Science
Information Theory
15 pages, 3 figures (please ignore the 16th page in the PDF file, which appears as a result of a temporary problem in the comp
Scientific paper
The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with {\em bounded complexity} per information bit. It also introduces symmetry properties which play a central role in the construction of capacity-achieving ensembles for the BEC. The results here improve on the tradeoff between performance and complexity provided by the first capacity-achieving ensembles of irregular repeat-accumulate (IRA) codes with bounded complexity per information bit; these IRA ensembles were previously constructed by Pfister, Sason and Urbanke. The superiority of ARA codes with moderate to large block length is exemplified by computer simulations which compare their performance with those of previously reported capacity-achieving ensembles of LDPC and IRA codes. The ARA codes also have the advantage of being systematic.
Pfister Henry D.
Sason Igal
No associations
LandOfFree
Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity 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 Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-406883