论文信息 - New upper bounds on the size of codes correcting asymmetric errors

New upper bounds on the size of codes correcting asymmetric errors

New upper bounds on the size of codes correcting asymmetric errors are derived by sharpening some of the constraints in the integer programming problem of Delsarte and Piret. It is shown that their code for length 9 and asymmetric distance 2 is optimal.

Jos H. Weber | Cornelis de Vroedt | Dick E. Boekee

[1] Torleiv Kløve,et al. Upper bounds on codes correcting asymmetric errors , 1981, IEEE Trans. Inf. Theory.

[2] N. J. A. Sloane,et al. Bounds for binary codes of length less than 25 , 1978, IEEE Trans. Inf. Theory.

[3] Philippe Piret,et al. Bounds and constructions for binary asymmetric error-correcting codes , 1981, IEEE Trans. Inf. Theory.

[4] R. R. Varshamov,et al. A class of codes for asymmetric channels and a problem from the additive theory of numbers , 1973, IEEE Trans. Inf. Theory.

[5] T. R. N. Rao,et al. On the theory of Binary Asymmetric Error Correcting Codes , 1979, Inf. Control..

[6] Wan H. Kim,et al. Single error-correcting codes for asymmetric binary channels , 1959, IRE Trans. Inf. Theory.