About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISIT 2005
Conference paper
Performance of product codes on channels with memory
Abstract
In this paper, we present an analytical method to compute the performance of product codes on channels with memory. A channel with memory introduces correlated error bursts, and hence, it is described as hidden Markov models. A hard-decision distance-bounded decoder for product code is assumed. Such an analysis is relevant for evaluating the performance of product-code-based error-correcting scheme employed in conventional tape drive systems. Using this analytical method, we present codeword-error rate plots for various Reed-Solomon codes based product codes.