By Topic

Linear-time binary codes correcting localized erasures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. Barg ; Lucent Technol., AT&T Bell Labs., Murray Hill, NJ, USA ; S. Zhou

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 present two constructions of binary codes with t(1+ε) check bits, where t=αn is the maximal possible number of erasures and ε>0 is a constant. The complexity of encoding and decoding for both constructions depends linearly on n

Published in:

Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on

Date of Conference:

16-21 Aug 1998