On unequal error protection of convolutional codes from an algebraic perspective

Chung-Hsuan Wang*, Mao Ching Chiu, Chi Chao Chao

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

In this paper, convolutional codes are studied for unequal error protection (UEP) from an algebraic theoretical viewpoint. We first show that for every convolutional code there exists at least one optimal generator matrix with respect to UEP. The UEP optimality of convolutional encoders is then combined with several algebraic properties, e.g., systematic, basic, canonical, and minimal, to establish the fundamentals of convolutional codes for UEP. In addition, a generic lower bound on the length of a UEP convolutional code is proposed. Good UEP codes with their lengths equal to the derived lower bound are obtained by computer search.

Original languageEnglish
Article number5361497
Pages (from-to)296-315
Number of pages20
JournalIEEE Transactions on Information Theory
Volume56
Issue number1
DOIs
StatePublished - 1 Jan 2010

Keywords

  • Basic/canonical/systematic generator matrices
  • Convolutional codes
  • Unequal error protection

Fingerprint Dive into the research topics of 'On unequal error protection of convolutional codes from an algebraic perspective'. Together they form a unique fingerprint.

Cite this