Cart (Loading....) | Create Account
Close category search window

Low delay burst erasure correcting codes for packet transmission

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
$31 $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)
Martinian, E. ; EECS Dept., MIT, Cambridge, MA, USA ; Sundberg, C.-E.W.

We present a bound relating the decoding delay, correctable burst length and rate of any erasure correcting code. Next we describe a new code construction which is optimal in the sense that the proposed codes have the shortest possible decoding delay allowed by our bound. These "maximally short" codes provide a useful tool to mitigate packet loss in delay sensitive applications.

Published in:

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

Date of Conference:


Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.