Back to Search
Start Over
Simple Capacity-Achieving Ensembles of Rateless Erasure-Correcting Codes.
- Source :
-
IEEE Transactions on Communications . Jan2010, Vol. 58 Issue 1, p110-117. 8p. - Publication Year :
- 2010
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00906778
- Volume :
- 58
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Communications
- Publication Type :
- Academic Journal
- Accession number :
- 48348676
- Full Text :
- https://doi.org/10.1109/TCOMM.2010.01.050175