论文信息 - A New Upper Bound on the Rate of Non-Binary Codes

A New Upper Bound on the Rate of Non-Binary Codes

New bounds on the rate of non-binary codes and non-binary constant weight codes are derived. The asymptotic forms of these bounds outperform known bounds in a wide range of distances. The method is based on analysis of subsets in products of Hamming and Johnson association schemes

Simon Litsyn | Yael Ben-Haim | S. Litsyn | Y. Ben-Haim

[1] Alexander Vardy,et al. Upper bounds for constant-weight codes , 2000, 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] G. Szegő. Polynomials orthogonal on the unit circle , 1939 .

[4] Alexander Barg,et al. Numerical results on the asymptotic rate of binary codes , 1999, Codes and Association Schemes.

[5] Simon Litsyn,et al. On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes , 1998, Des. Codes Cryptogr..

[6] Matti J. Aaltonen,et al. Linear programming bounds for tree codes (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[7] Matti J. Aaltonen,et al. A new upper bound on nonbinary block codes , 1990, Discret. Math..

[8] Alex Samorodnitsky,et al. On the Optimum of Delsarte's Linear Program , 2001, J. Comb. Theory, Ser. A.

[9] Victor Zinoviev,et al. An improvement of the Gilbert bound for constant weight codes , 1987, IEEE Trans. Inf. Theory.

[10] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .

[11] Robert J. McEliece,et al. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.

[12] Simon Litsyn,et al. Improved upper bounds on sizes of codes , 2002, IEEE Trans. Inf. Theory.