Sciweavers

Share
TCOM
2010

Simple capacity-achieving ensembles of rateless erasure-correcting codes

9 years 8 months ago
Simple capacity-achieving ensembles of rateless erasure-correcting codes
—This paper is concerned with a simple binary erasure-recovery coding scheme that falls into the family of socalled semi-random low-density-parity-check (SR-LDPC) codes. Based on a constrained random-scrambling technique, the proposed coding scheme is systematic, rateless, and capacityachieving. 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.
Xiaojun Yuan, Rong Sun, Li Ping
Added 30 Jan 2011
Updated 30 Jan 2011
Type Journal
Year 2010
Where TCOM
Authors Xiaojun Yuan, Rong Sun, Li Ping
Comments (0)
books