On the Weight Enumerator and the Maximum Likelihood Performance of Linear Product Codes

Simple item page
dc.creatorEl-Khamy, Mostafa
dc.creatorGarello, Roberto
dc.date2006-01-23
dc.date.accessioned2026-07-07T08:17:56Z
dc.date.available2026-07-07T08:17:56Z
dc.descriptionProduct codes are widely used in data-storage, optical and wireless applications. Their analytical performance evaluation usually relies on the truncated union bound, which provides a low error rate approximation based on the minimum distance term only. In fact, the complete weight enumerator of most product codes remains unknown. In this paper, concatenated representations are introduced and applied to compute the complete average enumerators of arbitrary product codes over a field Fq. The split weight enumerators of some important constituent codes (Hamming, Reed-Solomon) are studied and used in the analysis. The average binary weight enumerators of Reed Solomon product codes are also derived. Numerical results showing the enumerator behavior are presented. By using the complete enumerators, Poltyrev bounds on the maximum likelihood performance, holding at both high and low error rates, are finally shown and compared against truncated union bounds and simulation results.
dc.description26 pages, 10 figures, submitted to IEEE transactions in December 2005
dc.identifierhttps://arxiv.org/abs/cs/0601095
dc.identifierhttp://arxiv.org/abs/cs/0601095
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134261
dc.subjectInformation Theory
dc.subjectE.4
dc.titleOn the Weight Enumerator and the Maximum Likelihood Performance of Linear Product Codes
dc.typetext

Files

Collections

arXiv