Burst erasure correction capabilities of (n, n - 1) convolutional codes

Authors:
Huan Deng;Margreta Kuijper;Jamie Evans
Affiliations:
Deparment of Electrical and Electronic Engineering, University of Melbourne, VIC, Australia;Deparment of Electrical and Electronic Engineering, University of Melbourne, VIC, Australia;Deparment of Electrical and Electronic Engineering, University of Melbourne, VIC, Australia
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 4
Cited 0

Method to Recover Internet Packet Losses Using (n, n - 1, m) Convolutional Codes

DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Analysis of Using Convolutional Codes to Recover Packet Losses over Burst Erasure Channels

PRDC '01 Proceedings of the 2001 Pacific Rim International Symposium on Dependable Computing
Raptor codes

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Burst erasure correction codes with low decoding delay

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

For (n, k, m) systematic polynomial convolutional encoders, there exists an upperbound on the length of a correctable burst of erasures in terms of code parameters. In this paper, we restrict ourselves to the case k = n-1 and provide a necessary and sufficient condition to achieve the upperbound in terms of the encoder coefficients. In addition, for selected values of m, we present explicit (n, n-1, m) systematic polynomial convolutional encoders that achieve the upperbound.