We study a special case of Hamming-Huffman trees, in which both data compression and error detection are tackled on the same structure. Given hypercube Q n dimension , we interested some aspects its vertex neighborhoods. For subset L vertices neighborhood is defined as union neighborhoods . The minimum problem that determining cardinality over all those sets This well-known has already been sol...
