Binary codes with a minimum distance of four (Corresp.)
暂无分享,去创建一个
[1] Selmer M. Johnson. A new upper bound for error-correcting codes , 1962, IRE Trans. Inf. Theory.
[2] Andries E. Brouwer,et al. The triply shortened binary Hamming code is optimal , 1977, Discret. Math..
[3] N. Sloane,et al. Sphere Packings and Error-Correcting Codes , 1971, Canadian Journal of Mathematics.
[4] David Julin,et al. Two improved block codes (Corresp.) , 1965, IEEE Trans. Inf. Theory.
[5] Marcel J. E. Golay,et al. Binary coding , 1954, Transactions of the IRE Professional Group on Information Theory.
[6] Robert J. McEliece,et al. A low-rate improvement on the Elias bound (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[7] N. J. A. Sloane,et al. New family of single-error correcting codes , 1970, IEEE Trans. Inf. Theory.
[8] R. G. Stanton,et al. Maximal and minimal coverings of (k − 1)-tuples by k-tuples , 1968 .
[9] N. J. A. Sloane,et al. Bounds for binary codes of length less than 25 , 1978, IEEE Trans. Inf. Theory.