An improved upperbound for (n, k, m) systematic convolutional codes in burst erasure channels

Huan Deng, Margreta Kuijper, Jamie Scott Evans

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

1 Citation (Scopus)


For (n, k, m) systematic convolutional polynomial encoders, there exists an upperbound on the length of a correctable burst of erasures in terms of code parameters by Arai et al. in [7]. In this paper, we restrict ourselves to the burst-erasure correcting capabilities of (n, k, m) systematic convolutional polynomial encoders for m = fk - 1, where f is a natural number. We derive a new upperbound for systematic convolutional polynomial encoders with m = fk - 1 and show that it is tighter than Arai s. In addition, we provide necessary and sufficient conditions for achieving the improved upperbound in terms of the encoder coefficients.
Original languageEnglish
Title of host publicationAusCTW 2009 Australian Communications Theory Workshop
EditorsLeif Hanlen
Place of PublicationNew York NY USA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages33 - 37
Number of pages5
ISBN (Print)9781424433568
Publication statusPublished - 2009
Externally publishedYes
EventAustralian Communications Theory Workshop 2009 - Sydney, Australia
Duration: 4 Feb 20097 Feb 2009
Conference number: 10th (Proceedings)


ConferenceAustralian Communications Theory Workshop 2009
Abbreviated titleAusCTW 2009
Internet address

Cite this