Coding in the block-erasure channel

被引：0

作者：

Fabregas, Albert Guillen i ^{[1
]}

Tang, Qi ^{[1
]}

机构：

[1] Univ South Australia, Inst Telecommun Res, SPRI Bldg,Mawson Lakes Blvd, Mawson Lakes, SA 5095, Australia

来源：

7TH AUSTRALIAN COMMUNICATIONS THEORY WORKSHOP 2006, PROCEEDINGS | 2006年

基金：

澳大利亚研究理事会;

关键词：

D O I：

暂无

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

We study an M-ary block-erasure channel with B blocks, where with probability E a block of L coded symbols is erased. We study the behavior of the error probability of coded systems over such channels, and show that, if the code is diversitywise maximum-distance separable, its word error probability is equal to the outage probability, which admits a very simple expression. This paper is intended to complement the error probability analysis in previous work by Lapidoth and shed some light on the design of coding schemes for nonergodic channels.

引用

页码：19 / +

页数：2

共 11 条

[1]

[Anonymous], IEEE T INF THEORY

[2]

BOUTROS J, 2005, 43 ANN ALL C COMM CO

[3]

BOUTROS J, 2004, 42 ANN ALL C COMM CO

[4]

CAIRE G, 2003, COMMUNICATION JUL

[5]

Cover TM, 2006, Elements of Information Theory

[6]

*EPFL, COMM THEOR LAB

[7]

GALLAGER RG, 1968, RELIABLE COMMUNICATI

[8]

Guillen A., 2006, IEEE T INFORM THEORY, V52

[9] THE PERFORMANCE OF CONVOLUTIONAL-CODES ON THE BLOCK ERASURE CHANNEL USING VARIOUS FINITE INTERLEAVING TECHNIQUES [J].

LAPIDOTH, A .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (05) :1459-1473

[10]

RICHARDSON TJ, UNPUB MODERN CODING

← 1 2 →