On convergence speed of capacity-achieving sequences for erasure channel

被引：1

作者：

Lu, Min ^{[1
]}

机构：

[1] Penn State Univ, Dept Math, University Pk, PA 16802 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2008年 / 54卷 / 04期

关键词：

binary erasure channel; capacity-achieving sequences; low-density parity-check (LDPC) codes;

D O I：

10.1109/TIT.2008.917662

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Oswald and Shokrollahi carried out a systematic study of capacity-achieving sequences of low-density parity-check (LDPC) codes for the binary erasure channel. Two quantities it and A were suggested to measure the convergence speed of these sequences. They gave an upper bound of it for a certain type of capacity-achieving sequences. In this correspondence, a lower bound of mu for this type of sequences is provided. It follows that, under a certain condition, the exact value of p can be determined, which answers an open question posed by Oswald and Shokrollahi in their paper. If the condition is not satisfied the upper bound may not be tight. A counterexample is given.

引用

页码：1793 / 1794

页数：2

共 5 条

[1] Bounds on achievable rates of LDPC codes used over the binary erasure channel [J].

Barak, H ;

Burshtein, D ;

Feder, M .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (10) :2483-2489

[2]

LUBY M, P 29 ANN ACM S THEOR

[3] Efficient erasure correcting codes [J].

Luby, MG ;

Mitzenmacher, M ;

Shokrollahi, MA ;

Spielman, DA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :569-584

[4] Capacity-achieving sequences for the erasure channel [J].

Oswald, P ;

Shokrollahi, A .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (12) :3017-3028

[5]

SHOKROLLAHI A, 1999, AAECC, P65

← 1 →