1993/03/01 by R.M. Goodman, R.J. McEliece, Robert J. McEliece +1
Computer Science · Engineering · #Error Correcting Code Techniques #Coding theory and cryptography #Semiconductor materials and devices
paper · doi:10.1109/18.212304
Various aspects of single-phased burst-error-correcting array codes are explored. These codes are composed of two-dimensional arrays with row and column parities with a diagonally cyclic readout order; they are capable of correcting a single burst error along one diagonal. Optimal codeword sizes are found to have dimensions n/sub 1/*n/sub 2/ such that n/sub 2/ is the smallest prime number larger than n/sub 1/. These codes are capable of reaching the Singleton bound. A new type of error, approximate errors, is defined; in q-ary applications, these errors cause data to be slightly corrupted and therefore still close to the true data level. Phased burst array codes can be tailored to correct these codes with even higher rates than before.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>