Probabilistic crisscross error correction

IEEE Transactions on Information Theory

Volumn 43, Issue 5, 1997, Pages 1425-1438

  Roth, Ron M ^a,b,c  

^a IEEE   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Crisscross errors; Probabilistic coding; Rank metric

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); ERRORS; MATRIX ALGEBRA; PROBABILITY; REDUNDANCY; SIGNAL ENCODING; VECTORS;

PROBABILISTIC CODING; PROBABILISTIC CRISSCROSS ERROR CORRECTION; RANK METRIC;

ERROR CORRECTION;

EID: 0031233462     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623142     Document Type: Article

References (23)

1. E. R. Berlekamp, H. Rumsey, and G. Solomon, "On the solution of algebraic equations over finite fields," Inform. Contr., vol. 10, pp. 553-564, 1967.
2. N. L. Biggs, Discrete Mathematics. Oxford, UK: Oxford Univ. Press, 1985.
3. M. Blaum and R. J. McEliece, "Coding protection for magnetic tapes: A generalization of the Patel-Hong code," IEEE Trans. Inform. Theory, vol. IT-31, pp. 690-693, 1985.
4. P. Delsarte, "Bilinear forms over a finite field, with applications to coding theory," J. Comb. Theory A, vol. 25, pp. 226-241, 1978.
5. S. A. Elkind and D. P. Siewiorek, "Reliability and performance of error-correcting memory and register codes," IEEE Trans. Comput., vol. C-29, pp. 920-927, 1980.
6. P. G. Farrell, "A survey of array error control codes," Eur. Trans. Telecomm. Rel. Technol., vol. 3, pp. 441-454, 1992.
7. G. D. Forney, Jr., Concatenated Codes. Cambridge, MA: MIT Press, 1966.
8. E. M. Gabidulin, "Theory of codes with maximum rank distance," Probl. Pered. Inform., vol. 21, pp. 3-16 (in Russian), pp. 1-12 (in English), 1985.
9. _, "Optimal array error-correcting codes," Probl. Pered. Inform., vol. 21, pp. 102-106, 1985 (in Russian).
10. G. L. Katsman, M. A. Tsfasman, and S. G. Vladuţ, "Spectra of linear codes and error probability of decoding," in Proc. Int. Workshop on Coding Theory and Algebraic Geometry (Luminy, France, June 1991), pp. 82-98.
11. H. Stichtenoth and M. A. Tsfasman, Eds., Lecture Notes in Mathematics, vol. 1518. Berlin, Germany: Springer, 1992.
12. L. Levine and W. Meyers, "Semiconductor memory reliability with error detecting and correcting codes," Computer, vol. 9, pp. 43-50, Oct. 1976.
13. R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications (rev. ed.). Cambridge, UK: Cambridge Univ. Press, 1994.
14. S. Lin and D. J. Costello, Jr., Error Control Coding, Fundamentals and Applications. Englewoord Cliffs, NJ: Prentice-Hall, 1983.
15. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
16. R. J. McEliece, The Theory of Information and Coding. Reading, MA: Addison-Wesley, 1977.
17. W. F. Mikhail, R. W. Bartoldus, and R. A. Rutledge, "The reliability of memory with single-error correction," IEEE Trans. Comput., vol. C-31, pp. 560-564, 1983.
18. A. M. Patel and S. J. Hong, "Optimal rectangular code for high density magnetic tapes," IBM J. Res. Devel., vol. 18, pp. 579-588, 1974.
19. P. Prunsinkiewicz and S. Budkowski, "A double track error-correction code for magnetic tape," IEEE Trans. Comput., vol. C-25, pp. 642-645, 1976.
20. R. M. Roth, "Maximum-rank array codes and their application to crisscross error correction," IEEE Trans. Inform. Theory, vol. 37, pp. 328-336, 1991.
21. _, "Tensor codes for the rank metric," IEEE Trans. Inform. Theory, vol. 32, pp. 2146-2157, 1996.
22. R. M. Roth and G. Seroussi, "Reduced-redundancy product codes," in Proc. IEEE Int. Workshop on Information Theory (Haifa, Israel, June 1996), p. 78.
23. S. G. Williamson, Combinatorics for Computer Science. Rockville, MD: Comput. Sci. Press, 1985.