A new binary code of length 16 and minimum distance 3
We find by computer search a suitable (9,176,2) ( 9 , 176 , 2 ) binary code. The above code can be partitioned into 8 subcodes with minimum distance 3. Using this code we construct a (16,2816,3) ( 16 , 2816 , 3 ) binary code.
binary code block code hamming distance lower bound combinatorial problems