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

Huan Deng; Margreta Kuijper; Jamie Scott Evans

doi:10.1109/AUSCTW.2009.4805596

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 proceeding › Conference Paper › Research › peer-review

1 Citation (Scopus)

Abstract

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 language	English
Title of host publication	AusCTW 2009 Australian Communications Theory Workshop
Editors	Leif Hanlen
Place of Publication	New York NY USA
Publisher	IEEE, Institute of Electrical and Electronics Engineers
Pages	33 - 37
Number of pages	5
ISBN (Print)	9781424433568
DOIs	https://doi.org/10.1109/AUSCTW.2009.4805596
Publication status	Published - 2009
Externally published	Yes
Event	Australian Communications Theory Workshop 2009 - Sydney, Australia Duration: 4 Feb 2009 → 7 Feb 2009 Conference number: 10th https://ieeexplore.ieee.org/xpl/conhome/4802585/proceeding (Proceedings)

Conference

Conference	Australian Communications Theory Workshop 2009
Abbreviated title	AusCTW 2009
Country/Territory	Australia
City	Sydney
Period	4/02/09 → 7/02/09
Internet address	https://ieeexplore.ieee.org/xpl/conhome/4802585/proceeding (Proceedings)

Access to Document

10.1109/AUSCTW.2009.4805596

Cite this

@inproceedings{93da9942ea124bc08d1cdf197d42a369,

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

abstract = "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.",

author = "Huan Deng and Margreta Kuijper and Evans, \{Jamie Scott\}",

year = "2009",

doi = "10.1109/AUSCTW.2009.4805596",

language = "English",

isbn = "9781424433568",

pages = "33 -- 37",

editor = "Leif Hanlen",

booktitle = "AusCTW 2009 Australian Communications Theory Workshop",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

address = "United States of America",

note = "Australian Communications Theory Workshop 2009, AusCTW 2009 ; Conference date: 04-02-2009 Through 07-02-2009",

url = "https://ieeexplore.ieee.org/xpl/conhome/4802585/proceeding",

}

Deng, H, Kuijper, M & Evans, JS 2009, An improved upperbound for (n, k, m) systematic convolutional codes in burst erasure channels. in L Hanlen (ed.), AusCTW 2009 Australian Communications Theory Workshop. IEEE, Institute of Electrical and Electronics Engineers, New York NY USA, pp. 33 - 37, Australian Communications Theory Workshop 2009, Sydney, New South Wales, Australia, 4/02/09. https://doi.org/10.1109/AUSCTW.2009.4805596

An improved upperbound for (n, k, m) systematic convolutional codes in burst erasure channels. / Deng, Huan; Kuijper, Margreta; Evans, Jamie Scott.
AusCTW 2009 Australian Communications Theory Workshop. ed. / Leif Hanlen. New York NY USA: IEEE, Institute of Electrical and Electronics Engineers, 2009. p. 33 - 37.

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

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

AU - Deng, Huan

AU - Kuijper, Margreta

AU - Evans, Jamie Scott

N1 - Conference code: 10th

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4805596

U2 - 10.1109/AUSCTW.2009.4805596

DO - 10.1109/AUSCTW.2009.4805596

M3 - Conference Paper

SN - 9781424433568

SP - 33

EP - 37

BT - AusCTW 2009 Australian Communications Theory Workshop

A2 - Hanlen, Leif

PB - IEEE, Institute of Electrical and Electronics Engineers

CY - New York NY USA

T2 - Australian Communications Theory Workshop 2009

Y2 - 4 February 2009 through 7 February 2009

ER -

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

Abstract

Conference

Access to Document

Other files and links

Cite this