Published February 29, 1996
| public
Journal Article
Effective free distance of turbo codes
- Creators
- Divsalar, D.
- McEliece, R. J.
Abstract
The authors define and study the effective free distance of a turbo code. If a turbo code is constructed from a number of component codes, they argue that the effective free distance can be maximised by choosing the component codes to be IIR convolutional code fragments with maximal input weight-2 free distance. They then present some theoretical bounds for, and some numerical tables of; IIR code fragments with maximal input weight-2 free distance.
Additional Information
© 1996 The Institution of Engineering and Technology. The authors thank S.W. Golomb for his help in the derivation of Theorem 2. The research described in this paper was carried out at the Jet Propulsion Laboratory, California Institute of Technology, under contract with the National Aeronautics and Space Administration. McEliece's contribution was also partially supported by NSF grant no. NCR-9505975 and a grant from Pacific Bell.Additional details
- Eprint ID
- 29046
- Resolver ID
- CaltechAUTHORS:20120131-132952348
- NCR-9505975
- NSF
- Pacific Bell
- NASA
- Created
-
2012-02-24Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field