论文信息 - On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound

On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound

For any integer q we present a new bound which is a q-ary combinatorial analog of the binary Grey-Rankin bound. For any prime power q we present two infinite classes of q-ary codes which meet this bound with integral equality. Moreover, we show how codes meeting this bound with equality are connected to several important classical combinatorial configurations, such as difference matrices and generalized Hadamard matrices.

[1] S. S. Shrikhande,et al. Generalized Hadamard Matrices and Orthogonal Arrays of Strength Two , 1964, Canadian Journal of Mathematics.

[2] Gary McGuire,et al. Quasi-Symmetric Designs and Codes Meeting the Grey-Rankin Bound , 1997, J. Comb. Theory A.

[3] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[4] R. A. Rankin,et al. On the minimal points of positive definite quadratic forms , 1956 .

[5] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[6] L. D. Grey. Some bounds for error-correcting codes , 1962, IRE Trans. Inf. Theory.

[7] Hanfried Lenz,et al. Design theory , 1985 .

[8] Torleiv Kløve,et al. On the Hamming Distance Between Two i.i.d. Random n-Tuples over a Finite Set , 1999, IEEE Trans. Inf. Theory.

[9] Tor Helleseth,et al. On q-ary Grey-Rankin bound and codes meeting this bound , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[10] Tor Helleseth,et al. A bound for codes with given minimum and maximum distances , 2006, 2006 IEEE International Symposium on Information Theory.

[11] R. C. Bose,et al. Orthogonal Arrays of Strength two and three , 1952 .