On Bounded Weight Codes
COHEN, Gerard
Ministère de la Culture et de la communication, service du Livre et de la lecture, bureau du Patrimoine
Leer más >
Ministère de la Culture et de la communication, service du Livre et de la lecture, bureau du Patrimoine
COHEN, Gerard
Ministère de la Culture et de la communication, service du Livre et de la lecture, bureau du Patrimoine
< Leer menos
Ministère de la Culture et de la communication, service du Livre et de la lecture, bureau du Patrimoine
Idioma
en
Article de revue
Este ítem está publicado en
IEEE Transactions on Information Theory. 2011, vol. 57, n° 10, p. 6780-6787
Institute of Electrical and Electronics Engineers
Resumen en inglés
The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the ...Leer más >
The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to infinity for fixed d=D/N and w=W/N. The exponential growth rate of B(N,D,W) is shown to be equal to the exponential growth rate of A(N,D) for w <= 1/2, and equal to the exponential growth rate of A(N,D,W) for 1/2< w <= 1. Second, analytic and numerical upper bounds on B(N,D,W) are derived using the semidefinite programming (SDP) method. These bounds yield a non-asymptotic improvement of the second Johnson bound and are tight for certain values of the parameters.< Leer menos
Orígen
Importado de HalCentros de investigación