The clique distribution in powers of hypercubes (Q2235258)

A pertinent task in coding theory is to determine the values of \(A(n,d)\), where \(A(n,d)\) is the size of the maximum binary code set of length \(n\) and minimum Hamming distance \(d$. It can also be thought of as the size of the maximum independent set of \((d-1)\)th power of the \(n\)-dimensional hypercube \(Q_n\). In this paper the authors studied the distribution of the maximum clique and the structure of the point of \(Q_n^d\) for \(d\leq 5\). The proof techniques are quite mind blowing and novel. It will stimulate keen interest for further exploration.