Browse > Article
http://dx.doi.org/10.12673/jant.2011.15.5.781

A Weight on Boolean Algebras for Cryptography and Error Correcting Codes  

Yon, Yong-Ho (Innovation Center for Engineering Education, Mokwon University)
Kang, An-Na (Innovation Center for Engineering Education, Mokwon University)
Publication Information
Journal of Advanced Navigation Technology / v.15, no.5, 2011 , pp. 781-788 More about this Journal
Abstract
A sphere-packing problem is to find an arrangement of the spheres to fill as large area of the given space as possible, and covering problems are optimization problems which are dual problems to the packing problems. We generalize the concepts of the weight and the Hamming distance for a binary code to those of Boolean algebra. In this paper, we define a weight and a distance on a Boolean algebra and research some properties of the weight and the distance. Also, we prove the notions of the sphere-packing bound and the Gilbert-Varshamov bound on Boolean algebra.
Keywords
Boolean algebra; weight; distance; sphere-packing bound; Gilbert-Varshamov bound;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 3rd ed., New York, NY : Springer, 1999.
2 F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Code, North-Holland, Amsterdam, New York, Oxford, 1977.
3 M. Plotkin, Binary codes with specified minimum distance, IRE Trans. Inform. Theory, vol. IT-6, pp. 445-450, Sept. 1960,
4 G. D. Cohen, I. Honkala, S. Litsyn and A. Lobstein, Covering Codes, North-Holland, Amsterdam, 1997.
5 G. D. Cohen, M. G. Karpovsky, H. F. Jr. Mattson and J. R. Schatz, Covering Radius - Survey and Recent Results, IEEE Trans. Inform. Theory, vol. 31, pp. 328-343, 1985.   DOI
6 G. D. Cohen, S. N. Litsyn, A. C. Lobstein and H. F. Jr. Mattson, Covering Radius 1985-1994, Appl. Algebra Eng. Comm. Comp., vol. 8, pp. 173-239, 1997.   DOI   ScienceOn
7 R. L. Graham and N. J. A. Sloane, On the Covering Radius of Codes, IEEE Trans. Inform. Theory, vol. 31, pp. 385-401, 1985.   DOI
8 G. Wiechman and I. Sason, An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels, IEEE Trans. Inform. Theory, vol. 54. no. 5, pp. 1962-1990, May 2008.
9 K. Mahdaviani , S. Shahidi, S. Haddadi, M. Ardakani and C. Tellambura, Improving the Sphere-Packing Bound for Binary Codes over Memoryless Symmetric Channels, 47 Annual Allerton Conference, pp. 553-557, 2009.
10 V. Vu and L. Wu, Improving the Gilbert- Varshamov bound for q-ary codes, IEEE Trans. Inform. Theory, vol. 51, no. 9, pp. 3200 - 3208, Sept. 2005.   DOI   ScienceOn
11 R. Hill, A First Course in Coding Theory, Clarendon Press, Oxford, 1986.
12 S. Roman, Coding and Information Theory, Springer-Verlag, 1992.
13 H. Stichtenoth, Algebraic Function Fields and Codes, Springer-Verlag, 1993.
14 B. A. Davey and H. A. Priestley, Introduction to lattices and order, Cambridge University Press, Cambridge, 1990.
15 G. Grätzer, General lattice theory Academic press, inc. New York, 1978.