NEW SHORT CONSTRAINT LENGTH CONVOLUTIONAL CODE CONSTRUCTIONS FOR SELECTED RATIONAL RATES.

David G. Daut, James W. Modestino, Lee D. Wismer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

75 Citations (Scopus)

Abstract

New short constraint length convolutional code constructions are tabulated for rates R equals (n minus k)/n, k equals 1,2, multiplied by (times) multiplied by (times) multiplied by (times) , n minus 1 with n equals 2,3, multiplied by (times) multiplied by (times) multiplied by (times) , 8, and for constraint lenghts K equals 3,4, multiplied by (times) multiplied by (times) multiplied by (times) , 8. These codes have been determined by iterative search based upon a criterion of optimizing the free distance profile. Specifically, these codes maximize the free distance d//f while minimizing the number of adversaries in the distance, or weight, spectrum. In several instances the superiority of these codes over previously published code constructions at the same rate and constraint length is demonstrated. These codes are expected to have a number of applications, including combine source-channel coding schemes as well as coding for burst or impulsive noise channels.

Original languageEnglish (US)
Title of host publicationIEEE Transactions on Information Theory
Pages794-800
Number of pages7
VolumeIT-28
Edition5 pt 1
StatePublished - Sep 1982

Fingerprint

Convolutional codes
Impulse noise
Channel coding

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Daut, D. G., Modestino, J. W., & Wismer, L. D. (1982). NEW SHORT CONSTRAINT LENGTH CONVOLUTIONAL CODE CONSTRUCTIONS FOR SELECTED RATIONAL RATES. In IEEE Transactions on Information Theory (5 pt 1 ed., Vol. IT-28, pp. 794-800)

NEW SHORT CONSTRAINT LENGTH CONVOLUTIONAL CODE CONSTRUCTIONS FOR SELECTED RATIONAL RATES. / Daut, David G.; Modestino, James W.; Wismer, Lee D.

IEEE Transactions on Information Theory. Vol. IT-28 5 pt 1. ed. 1982. p. 794-800.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Daut, DG, Modestino, JW & Wismer, LD 1982, NEW SHORT CONSTRAINT LENGTH CONVOLUTIONAL CODE CONSTRUCTIONS FOR SELECTED RATIONAL RATES. in IEEE Transactions on Information Theory. 5 pt 1 edn, vol. IT-28, pp. 794-800.
Daut DG, Modestino JW, Wismer LD. NEW SHORT CONSTRAINT LENGTH CONVOLUTIONAL CODE CONSTRUCTIONS FOR SELECTED RATIONAL RATES. In IEEE Transactions on Information Theory. 5 pt 1 ed. Vol. IT-28. 1982. p. 794-800
Daut, David G. ; Modestino, James W. ; Wismer, Lee D. / NEW SHORT CONSTRAINT LENGTH CONVOLUTIONAL CODE CONSTRUCTIONS FOR SELECTED RATIONAL RATES. IEEE Transactions on Information Theory. Vol. IT-28 5 pt 1. ed. 1982. pp. 794-800
@inproceedings{1166ed6c3ab74101acd38842774bb500,
title = "NEW SHORT CONSTRAINT LENGTH CONVOLUTIONAL CODE CONSTRUCTIONS FOR SELECTED RATIONAL RATES.",
abstract = "New short constraint length convolutional code constructions are tabulated for rates R equals (n minus k)/n, k equals 1,2, multiplied by (times) multiplied by (times) multiplied by (times) , n minus 1 with n equals 2,3, multiplied by (times) multiplied by (times) multiplied by (times) , 8, and for constraint lenghts K equals 3,4, multiplied by (times) multiplied by (times) multiplied by (times) , 8. These codes have been determined by iterative search based upon a criterion of optimizing the free distance profile. Specifically, these codes maximize the free distance d//f while minimizing the number of adversaries in the distance, or weight, spectrum. In several instances the superiority of these codes over previously published code constructions at the same rate and constraint length is demonstrated. These codes are expected to have a number of applications, including combine source-channel coding schemes as well as coding for burst or impulsive noise channels.",
author = "Daut, {David G.} and Modestino, {James W.} and Wismer, {Lee D.}",
year = "1982",
month = "9",
language = "English (US)",
volume = "IT-28",
pages = "794--800",
booktitle = "IEEE Transactions on Information Theory",
edition = "5 pt 1",

}

TY - GEN

T1 - NEW SHORT CONSTRAINT LENGTH CONVOLUTIONAL CODE CONSTRUCTIONS FOR SELECTED RATIONAL RATES.

AU - Daut, David G.

AU - Modestino, James W.

AU - Wismer, Lee D.

PY - 1982/9

Y1 - 1982/9

N2 - New short constraint length convolutional code constructions are tabulated for rates R equals (n minus k)/n, k equals 1,2, multiplied by (times) multiplied by (times) multiplied by (times) , n minus 1 with n equals 2,3, multiplied by (times) multiplied by (times) multiplied by (times) , 8, and for constraint lenghts K equals 3,4, multiplied by (times) multiplied by (times) multiplied by (times) , 8. These codes have been determined by iterative search based upon a criterion of optimizing the free distance profile. Specifically, these codes maximize the free distance d//f while minimizing the number of adversaries in the distance, or weight, spectrum. In several instances the superiority of these codes over previously published code constructions at the same rate and constraint length is demonstrated. These codes are expected to have a number of applications, including combine source-channel coding schemes as well as coding for burst or impulsive noise channels.

AB - New short constraint length convolutional code constructions are tabulated for rates R equals (n minus k)/n, k equals 1,2, multiplied by (times) multiplied by (times) multiplied by (times) , n minus 1 with n equals 2,3, multiplied by (times) multiplied by (times) multiplied by (times) , 8, and for constraint lenghts K equals 3,4, multiplied by (times) multiplied by (times) multiplied by (times) , 8. These codes have been determined by iterative search based upon a criterion of optimizing the free distance profile. Specifically, these codes maximize the free distance d//f while minimizing the number of adversaries in the distance, or weight, spectrum. In several instances the superiority of these codes over previously published code constructions at the same rate and constraint length is demonstrated. These codes are expected to have a number of applications, including combine source-channel coding schemes as well as coding for burst or impulsive noise channels.

UR - http://www.scopus.com/inward/record.url?scp=0020180448&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020180448&partnerID=8YFLogxK

M3 - Conference contribution

VL - IT-28

SP - 794

EP - 800

BT - IEEE Transactions on Information Theory

ER -