By Topic

On deletion codes

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. Tavory ; Dept. of Electr. Eng. - Syst., Tel Aviv Univ., Israel ; M. Feder

In a deletion channel, some symbols might be "dropped off" during transmission. The receiver knows that some symbols were omitted, but does not know either their values or their indices. We introduce a linear-time code correcting a fixed number of deletions, with a message-overhead linear in the number of deletions and less than log squared in the original message length. We also present some extensions of known bounds for deletion codes. In a UEP (unequal error protection) coding setting, each message part is assigned a priority value, determining its required resiliency to errors. Depending on this priority, and the numbers of errors actually taking place, this message part should be recoverable. Extending previous work that dealt with UEP in the context of erasures, we introduce codes and bounds for UEP in the context of deletions, which are relevant to lossy packet-networks.

Published in:

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

Date of Conference: