Decoding of Cluster Array Errors in Row-Cyclic Array Codes
نویسندگان
چکیده
Row-cyclic array codes equipped with m-metric [13] suitable for parallel channel communication systems have been introduced by the first author in [10] and the notion of cluster/burst array errors were introduced by the first author in [6]. In this paper, we study cluster array errors detection and correction in row-cyclic array codes.
منابع مشابه
G. Richter and S. Plass: Error and Erasure Decoding of Rank-Codes with a Modified Berlekamp-Massey Algorithm, in Proc. of ITG Conference on Source
This paper investigates error and erasure decoding methods for codes with maximum rank distance. These codes can be used for correcting column and row errors and erasures in an ( ) array. Such errors occur e.g. in magnetic tape recording or in memory chip arrays. For maximum rank distance codes (Rank-Codes), there exists a decoding algorithm similar to the Peterson-Gorenstein-Zierler technique ...
متن کاملCorrection to "A decoding algorithm with restrictions for array codes"
We present a simple and efficient error correction scheme for array-like data structures. We assume that the channel behaves such that each row of a received array is either error-free or corrupted by many symbol errors. Provided that row error vectors are linearly independent, the proposed decoding algorithm can correct asymptotically one erroneous row per redundant row, even without having re...
متن کاملThree-Dimensional Fire Codes
Binary cyclic three–dimensional array codes that can correct three–dimensional bursts (or clusters ) of errors are considered. The class of binary cyclic three–dimensional burst–error–correcting array codes, called three–dimensional Fire codes, is constructed. Several important properties such as the burst–error–correcting capability and the positions of the parity–check symbols are presented. ...
متن کاملNew array codes for multiple phased burst correction
Abstmct-A new optimal family of array codes over GF(q) for correcting multiple phased burst errors and erasures, where each phased burst corresponds to an erroneous or erased column in a code array, is presented. As for erasures, these array codes have an efficient decoding algorithm which avoids multiplications (or divisions) over extension fields, replacing these operations with cyclic shifts...
متن کاملMDS array codes for correcting a single criss-cross error
We present a family of Maximum-Distance Separable (MDS) array codes of size ( 1) ( 1), a prime number, and minimum criss-cross distance 3, i.e., the code is capable of correcting any row or column in error, without a priori knowledge of what type of error occurred. The complexity of the encoding and decoding algorithms is lower than that of known codes with the same error-correcting power, sinc...
متن کامل