On the maximum cardinality of binary constant weight codes with prescribed distance
暂无分享,去创建一个
Abstract Let A ( n, d, w ) be the maximum cardinality of a binary code with length n , constant weight w (0 ⩽ w ⩽ ⌊n/2⌋) and Hamming distance d . In this paper a method is discussed in order to determine upper bounds for A ( n, d, w ), combining ideas from Delsarte (1973), Johnson (1972) and de Vroedt (1980).
[1] Selmer M. Johnson,et al. Upper bounds for constant weight error correcting codes , 1972, Discret. Math..
[2] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .