• Title/Summary/Keyword: sphere-packing bound

Search Result 1, Processing Time 0.013 seconds

A Weight on Boolean Algebras for Cryptography and Error Correcting Codes (암호학 및 오류 수정 코드를 위한 부울 대수 가중치 연구)

  • Yon, Yong-Ho;Kang, An-Na
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.5
    • /
    • pp.781-788
    • /
    • 2011
  • 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.