Abstract
A tabulation of binary systematic convolutional codes with an optimum distance profile for rates1/3and1/4is given. A number of short rate1/3binary nonsystematic convolutional codes are listed. These latter codes are simultaneously optimal for the following distance measures: distance profile, minimum distance, and free distance; they appear attractive for use with Viterbi decoders. Comparisons with previously known codes are made.
| Original language | English |
|---|---|
| Pages (from-to) | 281-283 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 23 |
| Issue number | 2 |
| Publication status | Published - 1977 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering