Abstract
Improved bounds for A(n,d) , the maximum number of codewords in a (linear or nonlinear) binary code of word length n and minimum distance d , and for A(n,d,w) , the maximum number of binary vectors of length n , distance d , and constant weight w in the range n \leq 24 and d \leq 10 are presented. Some of the new values are A
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
