Journal article
Concatenated codes with convolutional inner codes
In
I E E E Transactions on Information Theory
—
1988, Volume 34, Issue 5, pp. 1217-1225
Abstract
The minimum distance of concatenated codes with Reed-Solomon outer codes and convolutional inner codes is studied. For suitable combinations of parameters the minimum distance can be lower-bounded by the product of the minimum distances of the inner and outer codes. For a randomized ensemble of concatenated codes a lower bound of the Gilbert-Varshamov type is proved
| Language: | English |
|---|---|
| Publisher: | IEEE |
| Year: | 1988 |
| Pages: | 1217-1225 |
| ISSN: | 15579654 and 00189448 |
| Types: | Journal article |
| DOI: | 10.1109/18.21249 |
