Error-correcting codes from graphs

Discrete Mathematics

Volumn 257, Issue 2-3, 2002, Pages 549-557

  Tonchev, Vladimir D ^a  

^a MICHIGAN TECHNOLOGICAL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646132558     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00513-7     Document Type: Article

References (13)

1. A.E. Brouwer, T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes, IEEE Trans. Inform. Theory 39 (1993) 662-677.
2. A.R. Calderbank, E.M. Rains, P.W. Shor, N.J.A. Sloane, Quantum error correction and orthogonal geometry, Phys. Rev. Lett. 78(3) (1997) 405-408.
3. A.R. Calderbank, E.M. Rains, P.W. Shor, N.J.A. Sloane, Quantum error correction via codes over GF(4), IEEE Trans. Inform. Theory 44 (1998) 1369-1387.
4. A.R. Calderbank, P.W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A, 54 (1996) 1098-1105.
5. D. Dieks, Communication by EPR devices, Phys. Lett. A 92 (1982) 271.
6. E. Knill, Adventures in experimental quantum error-correction, IMA Workshop on Coding and Cryptography, Minneapolis, July 1998.
7. F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
8. P.W. Shor, Scheme for reducing decoherence in quantum memory, Phys. Rev. A 52 (1995) 2493.
9. V.D. Tonchev, Rank 3 graphs, block designs and unequal error protection codes, Problemi peredatchi informatsii 27(2) (1981) 19-25 (in Russian).
10. V.D. Tonchev, Combinatorial Configurations, Longman, Wiley, New York, 1988.
11. V.D. Tonchev, Binary codes derived from the Huffman-Singleton and Higman-Sims graphs, IEEE Trans. Inform. Theory 43 (1997) 1021-1025.
12. V.D. Tonchev, Codes and Designs, in: V.S. Pless, W.C. Huffman (Eds.), Handbook of Coding Theory, Chapter 15, Elsevier, Amsterdam, 1998, pp. 1229-1267.
13. W.K. Wooters, W.H. Zurek, A single quantum cannot be cloned, Nature 299 (1982) 802.