An Optimal Partial Decoding Algorithm for Rateless Codes

被引：0

作者：

Bioglio, V. ^{[1
]}

Grangetto, M. ^{[1
]}

Gaeta, R. ^{[1
]}

Sereno, M. ^{[1
]}

机构：

[1] Univ Turin, Dipartimento Informat, I-10149 Turin, Italy

来源：

2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) | 2011年

关键词：

LT codes; Partial decoding; incremental decoding; rateless codes;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Rateless codes are designed to decode all the input symbols when a certain number of coded symbols have been received. However, it is possible to recover a subset of the input symbols from the actually received coded symbols: this process is called partial decoding and the number of recovered input symbols is termed the intermediate performance of rateless codes. In this paper we study the problem of the optimality of the partial decoding process: we say that a partial decoding algorithm is optimal if, given a rateless code, it is able to maximize the intermediate performance of the code, i.e. it is able to retreive the maximum number of input symbols when a certain number n of coded symbols have been received, for every n. We propose OPD, an optimal partial decoding algorithm for any rateless code, proving its optimality. The proposed algorithm is finally used to analyze the intermediate performance of LT codes.

引用

页码：2731 / 2735

页数：5

共 10 条

[1]

Hu KT, 2007, IEEE COMMUN LETT, V11, P343, DOI [10.1109/LCOM.2007.348295, 10.1109/LCOMM.2007.061939]

[2] Growth codes: Maximizing sensor network data persistence [J].

Kamra, Abhinav ;

Feldman, Jon ;

Misra, Vishal ;

Rubenstein, Dan .

ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2006, 36 (04) :255-266

[3]

Kim S, 2009, 11TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY, VOLS I-III, PROCEEDINGS,, P1682

[4] LT Codes Decoding: Design and Analysis [J].

Lu, Feng ;

Foh, Chuan Heng ;

Cai, Jianfei ;

Chia, Liang-Tien .

2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, :2492-+

[5]

Luby M, 2002, ANN IEEE SYMP FOUND, P271, DOI 10.1109/SFCS.2002.1181950

[6] Fountain codes [J].

MacKay, DJC .

IEE PROCEEDINGS-COMMUNICATIONS, 2005, 152 (06) :1062-1068

[7] Intermediate performance of rateless codes [J].

Sanghavi, Sujay .

2007 IEEE INFORMATION THEORY WORKSHOP, VOLS 1 AND 2, 2007, :478-482

[8]

Sereno M., 2010, P ACM WORKSH ADV VID, P7

[9]

Talari A., 2009, GLOBECOM 2009 DEC

[10] rStream: Resilient and optimal peer-to-peer streaming with rateless codes [J].

Wu, Chuan ;

Li, Baochun .

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2008, 19 (01) :77-92

← 1 →