Simple capacity-achieving ensembles of rateless erasure-correcting codes

Authors:
Xiaojun Yuan;Rong Sun;Li Ping
Affiliations:
Department of Electrical Engineering, University of Hawaii at Manoa, Hawaii and Department of Electrical Engineering, City University of Hong Kong, HK SAR;State Key Lab of ISN, Xidian University, Xi'an, P. R. China and Department of Electrical Engineering, City University of Hong Kong, HK SAR;Department of Electrical Engineering, City University of Hong Kong, HK SAR
Venue:
IEEE Transactions on Communications
Year:
2010

Citing 15
Cited 0

LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity

AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Raptor codes

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Unveiling turbo codes: some results on parallel concatenated coding schemes

IEEE Transactions on Information Theory
Efficient erasure correcting codes

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Concatenated tree codes: a low-complexity, high-performance approach

IEEE Transactions on Information Theory
Zigzag codes and concatenated zigzag codes

IEEE Transactions on Information Theory
Capacity-achieving sequences for the erasure channel

IEEE Transactions on Information Theory
Parity-check density versus performance of binary linear block codes over memoryless symmetric channels

IEEE Transactions on Information Theory
Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel

IEEE Transactions on Information Theory
Rate-compatible puncturing of low-density parity-check codes

IEEE Transactions on Information Theory
Capacity-achieving ensembles for the binary erasure channel with bounded complexity

IEEE Transactions on Information Theory
Raptor codes on binary memoryless symmetric channels

IEEE Transactions on Information Theory
Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with a simple binary erasure-recovery coding scheme that falls into the family of so-called semi-random low-density-parity-check (SR-LDPC) codes. Based on a constrained random-scrambling technique, the proposed coding scheme is systematic, rateless, and capacity-achieving. We provide simulation examples comparing the new scheme with the well-known Luby Transform (LT) and raptor codes. It is shown that the new scheme has advantages in complexity and performance over its counterparts especially in channels with a relatively low erasure rate.