Computer Science – Information Theory
Scientific paper
2006-01-23
Computer Science
Information Theory
26 pages, 10 figures, submitted to IEEE transactions in December 2005
Scientific paper
Product 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.
El-Khamy Mostafa
Garello Roberto
No associations
LandOfFree
On the Weight Enumerator and the Maximum Likelihood Performance of Linear Product Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Weight Enumerator and the Maximum Likelihood Performance of Linear Product Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Weight Enumerator and the Maximum Likelihood Performance of Linear Product Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-601191