### 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 language | English (US) |
---|---|

Title of host publication | IEEE Transactions on Information Theory |

Pages | 794-800 |

Number of pages | 7 |

Volume | IT-28 |

Edition | 5 pt 1 |

State | Published - Sep 1982 |

### Fingerprint

### ASJC Scopus subject areas

- Information Systems
- Electrical and Electronic Engineering

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IEEE Transactions on Information Theory.*5 pt 1 edn, vol. IT-28, pp. 794-800.

}

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

AN - SCOPUS:0020180448

VL - IT-28

SP - 794

EP - 800

BT - IEEE Transactions on Information Theory

ER -