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
| Original language | English |
|---|---|
| Journal | I E E E Transactions on Information Theory |
| Volume | 34 |
| Issue number | 5 |
| Pages (from-to) | 1217-1225 |
| ISSN | 0018-9448 |
| DOIs | |
| Publication status | Published - 1988 |
Bibliographical note
Copyright: 1988 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEEFingerprint
Dive into the research topics of 'Concatenated codes with convolutional inner codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver