Linear-time binary codes correcting localized erasures
Barg, A.
Shiyu Zhou
Lucent Technol., Bell Labs., Murray Hill, NJ;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Nov 1999
Volume: 45,
Issue: 7
On page(s): 2547-2552
ISSN: 0018-9448
References Cited: 15
CODEN: IETTAW
INSPEC Accession Number: 6418586
Digital Object Identifier: 10.1109/18.796405
Current Version Published: 2002-08-06
Abstract
We consider a communication model over a binary channel in which
the transmitter knows which bits of the n-bit transmission are prone to
loss in the channel. We call this model channel with localized erasures
in analogy with localized errors studied earlier in the literature. We
present two constructions of binary codes with t(1+ε) check bits,
where t=αn is the maximal possible number of erasures. One
construction is on-line and has encoding complexity of order n/ε
4 and decoding complexity of order n/ε2. The
other construction is recursive. The encoding/decoding algorithms assume
a delay of n bits i.e. rely on the entire codeword. The
encoding/decoding complexity behaves roughly as n/ε2
and n/ε, respectively
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
