On systematic LT codes

Xiaojun Yuan; Li Ping

doi:10.1109/LCOMM.2008.080825

On systematic LT codes

Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review

Overview

34 Scopus Citations

Scopus Metrics

View graph of relations

Author(s)

Xiaojun Yuan
Li Ping

Related Research Unit(s)

Department of Electrical Engineering

Detail(s)

Original language	English
Pages (from-to)	681-683
Journal / Publication	IEEE Communications Letters
Volume	12
Issue number	9
Publication status	Published - 2008

Link(s)

DOI	DOI https://doi.org/10.1109/LCOMM.2008.080825 Final Published version
	Check@CityULib
Link to Scopus	https://www.scopus.com/record/display.uri?eid=2-s2.0-52649083754&origin=recordpage
Permanent Link	https://scholars.cityu.edu.hk/en/publications/publication(7eecadae-c524-45d7-92db-47668744ee58).html

Abstract

We propose a family of systematic rateless codes that are universally capacity-approaching on a binary erasure channel (BEC) regardless of the channel erasure rate. A significant property of the proposed codes is their linear encoding and decoding complexity, which is considerably lower than existing alternatives. © 2008 IEEE.