On the Voronoi neighbor ratio for binary linear block codes

IEEE Transactions on Information Theory

Volumn 44, Issue 7, 1998, Pages 3064-3072

  Agrell, Erik ^a,b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Asymptotic properties; Binary linear block codes; Gaussian channel; Neighbor ratio; Soft decision decoding; Voronoi regions

Indexed keywords

ALGORITHMS; BINARY CODES; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; SPURIOUS SIGNAL NOISE; VECTORS;

BINARY LINEAR BLOCK CODES; GAUSSIAN CHANNELS; SOFT-DECISION DECODING; VORONOI NEIGHBOR RATIO;

BLOCK CODES;

EID: 0032202085     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.737535     Document Type: Article

References (34)

1. S. G. Wilson, Digital Modulation and Coding. Upper Saddle River, NJ: Prentice-Hall, 1996.
2. G. C. Clark, Jr. and J. B. Cain, Error-Correction Coding for Digital Communications. New York: Plenum, 1981.
3. R. E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1983.
4. J. H. Conway and N. J. A. Sloane, "Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice," IEEE Trans. Inform. Theory, vol. IT-32, pp. 41-50, Jan. 1986.
5. M. P. C. Fossorier and S. Lin, "Soft-decision decoding of linear block codes based on ordered statistics," IEEE Trans. Inform. Theory, vol. 41, pp. 1379-1396, Sept. 1995.
6. A. Okabe, B. Boots, and K. Sugihara, Spatial Tessellations. Con- cepts and Applications of Voronoi Diagrams. Chichester, U.K.: Wiley, 1992.
7. C. E. Shannon, "Probability of error for optimal codes in a Gaussian channel," Bell Syst. Tech. J., vol. 38, no. 3, pp. 611-656, May 1959.
8. D. Slepian, "Permutation modulation," Proc. IEEE, vol. 53, pp. 228-236, Mar. 1965.
9. _, "Group codes for the Gaussian channel," Bell Syst. Tech. J., vol. 47, no. 4, pp. 575-602, Apr. 1968.
10. G. D. Forney, Jr., "Geometrically uniform codes," IEEE Trans. Inform. Theory, vol. 37, pp. 1241-1260, Sept. 1991.
11. I. Ingemarsson, "Group codes for the Gaussian channel," in Topics in Coding Theory. In Honor of Lars H. Zetterberg, M. Thoma and A. Wyner, Eds. Berlin, Germany: Springer-Verlag, 1989, pp. 73-108.
12. E. Agrell, "Voronoi regions for binary linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 310-316, Jan. 1996.
13. H. Edelsbrunner, Algorithms in Combinatorial Geometry. Berlin, Ger- many: Springer-Verlag, 1987.
14. E. Viterbo and E. Biglieri, "Computing the Voronoi cell of a lattice: The diamond-cutting algorithm," IEEE Trans. Inform. Theory, vol. 42, pp. 161-171, Jan. 1996.
15. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
16. H. J. Landau, "How does a porcupine separate its quills?," IEEE Trans. Inform. Theory, vol. IT-17, pp. 157-161, Mar. 1971.
17. T.-Y. Hwang, "Decoding linear block codes for minimizing word error rate," IEEE Trans. Inform. Theory, vol. IT-25, pp. 733-737, Nov. 1979.
18. P. Butovitsch, "Classification of signal sets. The classification capability of multi-layer perceptrons and soft-decision decoding of error-correcting codes," Ph.D. dissertation, Roy. Inst. Technol., Stockholm, Sweden, 1994.
19. P. J. Green and R. Sibson, "Computing Dirichlet tessellations in the plane," Comput. J., vol. 21, no. 2, pp. 168-173, May 1978.
20. E. Agrell and P. Hedelin, "How to evaluate search methods for vec- tor quantization," in Proc. Nordic Signal Processing Symp. (Ålesund, Norway, June 1994), pp. 258-263,.
21. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
22. G. D. Forney, Jr., "Dimension/length profiles and trellis complexity of linear block codes," IEEE Trans. Inform. Theory, vol. 40, pp. 1741-1752, Nov. 1994.
23. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, nos. 3 and 4, pp. 379-423 and 623-656, July and Oct. 1948.
24. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
25. J. N. Pierce, "Limit distribution of the minimum distance of random linear codes," IEEE Trans. Inform. Theory, vol. IT-13, pp. 595-599, Oct. 1967.
26. W. W. Peterson, Error-Correcting Codes. Cambridge, MA: MIT Press and New York: Wiley, 1961.
27. C. E. Shannon, "Communication in the presence of noise," Proc. IRE, vol. 37, pp. 10-21, Jan. 1949.
28. D. Slepian, "Some further theory of group codes," Bell Syst. Tech. J., vol. 39, no. 5, pp. 1219-1252, Sept. 1960.
29. J. H. van Lint, "Repeated-root cyclic codes," IEEE Trans. Inform. Theory, vol. 37, pp. 343-345, Mar. 1991.
30. G. Castagnoli, "On repeated-root cyclic codes," IEEE Trans. Inform. Theory, vol. 37, pp. 337-342, Mar. 1991.
31. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
32. R. J. McEliece, E. R. Rodemich, H. Rumsey, Jr., and L. R. Welch, "New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities," IEEE Trans. Inform. Theory, vol. IT-23, pp. 157-166, Mar. 1977.
33. S. B. Wicker, Error Control Systems for Digital Communication and Storage. Englewood Cliffs, NJ: Prentice-Hall, 1995.
34. A. Ashikhmin and A. Barg, "Minimal vectors in linear codes," IEEE Trans. Inform. Theory, vol. 44, pp. 2010-2017, Sept. 1998.