Abstract: This paper gives two new bounds for the code word length n which is required to obtain a binary group code of order 2 k with mutual distance d between code words. These bounds are compared ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback