Title :
On q-ary Grey-Rankin bound and codes meeting this bound
Author :
Dodunekov, Stefan ; Helleseth, Tor ; Zinoviev, Victor
Author_Institution :
Inst. of Math. & Informatics, Bulgarian Acad. of Sci., Sofia, Bulgaria
fDate :
27 June-2 July 2004
Abstract :
We consider the q-ary analog of the binary Grey-Rankin bound, recently suggested by Fu, Kloeve and Shen. For any prime power q≥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.
Keywords :
concatenated codes; linear codes; polynomials; concatenation construction; infinite family codes; linear resulting code; prime power; q-ary Grey-Rankin bound; Concatenated codes; Contracts; Councils; Hamming distance; Informatics; Mathematics;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365564
