Abstract
Improved upper bounds for A ( n, d ), the maximum number of codewords in a binary code of word length n and minimum distance at least d , are presented in case n = 2 d + j , where j is small.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
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
