Location-correcting codes

IEEE Transactions on Information Theory

Volumn 42, Issue 2, 1996, Pages 554-565

  Roth, Ron M ^a,b   Seroussi, Gadiel ^a,c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Hewlett Packard Co Israel Sci Ctr   (Israel)

^c HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Bounds on code parameters; Decomposability distance; Error locations; Error values; Location correcting codes; Sidon sets

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; ERROR CORRECTION; MATHEMATICAL MODELS; REDUNDANCY; SET THEORY;

DECOMPOSABILITY DISTANCE; ERROR LOCATIONS; LOCATION CORRECTING CODES;

CODES (SYMBOLS);

EID: 0030109235     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.485724     Document Type: Article

References (23)

1. R. Ahlswede, !.. A. Bassalygo, and M. S. Pinsker, "Asymptotically dense nonbinary codes correcting a constant number of localized errors," in Proc. 3rd Int. Workshop on Algebraic and Combinat. Coding Theory (Tyinovo, Bulgaria, 1992).
2. "Nonbinary codes correcting Iocali2.ed errors," IEEE Trans. Inform. Theory, vol. 39, pp. 1413-1416, 1993.
3. N. Alon, H. Lefmann and V. Rödl, "On an anti-Ramsey type result," Colloq. Math. Soc. Jànos Bolyai 60: Sets, Graphs, and Numbers (Budapest, Hungary), pp. 9-22, 1991.
4. L. Babai and V. T. Sos, "Sidon sets in groups and induced subgraphs of Cayley graphs," European J. Comb., vol. 6, pp. 101-114, 1985.
5. L. A. Bassalygo, S. I. Gclfand, and M. S. Pinsker, "Coding for channels with localized errors," in Proc. 4th Soviet-Swedish Workshop in Information Theory (Gotland, Sweden, 1989), pp. 95-99.
6. "Coding for channels with partially localized errors." IEEE Trans. Inform. Theory, vol. 37, pp. 880-884, 1991.
7. "Simple methods of deduction of lower bounds in coding theory," Probl. Pered. Inform., vol. 27, no. 4, pp. 3-8, 1991.
8. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, "A new table of constant weight codes," IEEE Trans. Inform. Theory, vol. 36, pp. 1334-1380, 1990.
9. H. Davenport, Multiplicative Number Theory, 2nd ed., revised by H. L. Montgomery. Berlin, Germany: Springer, 1980.
10. G. T. Diderrich and H. B. Mann, "Combinatorial problems in finite Abelian groups," A Survey of Combinatorial Theory, J. N. Srivastava et al., Eds. Amsterdam, The Netherlands: North-Holland, 1973.
11. E. M. Gabidulin, "Theory of codes with maximum rank distance," Probl. Pered. Inform., vol. 21, pp. 3-16, 1985 (in Russian; pp. 1-12 in the English translation).
12. M. R. Garey and D. S. Johnson, Computers and Intractability-A Guide to the Theory oj'NF'-Completeness. New York: Freeman, 1979.
13. J. M. Goethals, "Cyclic error-locating codes," Inform, Contr., vol. 10, pp. 378-385, 1967.
14. R. L. Graham and N. J. A. Sloane, "On additive bases and harmonious graphs," SIAM J. Alg. Disc. Meth., vol. 1, pp. 382-404, 1980.
15. M. Hall, Jr., Combinatorial Theory, 2nd ed. New York: Wiley, 1986.
16. G. A. Kabatyansky. "The construction of code correcting single localized error," in Proc. 3rd Int. Workshop on Algebraic and Combinat. Coding Theory (Tyrnovo, Bulgaria, 1992).
17. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
18. J. E. Olson, "A combinatorial problem on finite Abelian groups, I," J. Number Theory, vol. 1, pp. 8-10, 1969.
19. "A combinatorial problem on finite Abelian groups, TJ," J. Number Theory, vol. 1, pp. 195-199, 1969.
20. J. B Rosser and L. Schoenfeld, "Approximate formulas for some functions of prime numbers," Illinois J. Math., vol. 6, pp. 64-94, 1962.
21. R. M. Roth, "Maximum-rank array codes and their application to crisscross error correction," IEEE Trans. Inform. Theory, vol. 37, pp. 328-336, 1991.
22. J. K. Wolf, "On an extended class of error-locating codes," Inform. Contr., vol. 8, pp. 163-169, 1963.
23. J. K. Wolfand B. Elspas, "Error locating codes-A new concept in error control," IEEE Trans. Inform. Theory, vol. IT9, pp. 113-117, 1963.