Published June 2005
| Version public
Book Section - Chapter
The Average Weight Enumerator and the Maximum Likelihood Performance of Product Codes
Abstract
Product codes are widely used in data-storage, optical and wireless applications. Performance analysis of the product codes in the literature relied on the truncated union lower bounds due to lack of the knowledge of the weight enumerator of most product codes. In this paper, average weight enumerators of arbitrary product codes over F_q are derived. The split weight enumerators of some linear codes are studied and are used in the analysis. The average binary weight enumerator of product Reed Solomon codes is derived. The relationship between the codeword weight and the coordinate weight is discussed for product codes. Consequently, tight bounds on the performance of product codes at low signal to noise ratios are shown.
Additional Information
© 2005 IEEE. Issue Date: 13-16 June 2005. Date of Current Version: 05 December 2005. This research was supported by NSF grant no. CCR-0118670 and grants from Sony, Qualcomm, and the Lee Center for Advanced Networking. The author would like to thank R. McEliece and J. Thorpe for useful discussions.Additional details
Identifiers
- Eprint ID
- 24898
- DOI
- 10.1109/WIRLES.2005.1549650
- Resolver ID
- CaltechAUTHORS:20110817-073434888
Funding
- NSF
- CCR-0118670
- Sony
- Qualcomm
- Caltech Lee Center for Advanced Networking
Dates
- Created
-
2011-08-17Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
Caltech Custom Metadata
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 8773822