论文信息 - On q-ary Grey-Rankin bound and codes meeting this bound

On q-ary Grey-Rankin bound and codes meeting this bound

We consider the q-ary analog of the binary Grey-Rankin bound, recently suggested by Fu, Kloeve and Shen. For any prime power q/spl ges/2, we give an infinite family of codes which reach this bound with equality. If the outer and inner codes are chosen as linear, a linear resulting code is obtained by the concatenation construction.

Tor Helleseth | Victor Zinoviev | Stefan M. Dodunekov

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

[2] 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.