Abstract

A fundamental problem in coding theory is to find the values of A(n,d), i.e., the A(n,d) is the size of the maximum binary code set of length n and minimum Hamming distance d. And A(n,d) can also be viewed as the size of maximum independent set of d−1th-power of the n-dimensional hypercube Qn. In order to further understand and study this problem, we study the distribution of the maximum clique and the structure of the point of Qnd for d≤5.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call