DocumentCode :
1365624
Title :
New Completely Regular 
-ary Codes Based on Kronecker Products
Author :
Rifà, Josep ; Zinoviev, Victor A.
Author_Institution :
Dept. of Inf. & Commun. Eng., Univ. Autonoma de Barcelona, Bellaterra, Spain
Volume :
56
Issue :
1
fYear :
2010
Firstpage :
266
Lastpage :
272
Abstract :
For any integer ¿ ¿ 1 and for any prime power q , an explicit construction of an infinite family of completely regular (and completely transitive) q-ary codes with d = 3 and with covering radius ¿ is given. The intersection array is also computed. Under the same conditions, the explicit construction of an infinite family of q-ary uniformly packed codes (in the wide sense) with covering radius ¿, which are not completely regular, is also given. In both constructions, the Kronecker product is the basic tool that has been used.
Keywords :
product codes; intersection array; kronecker products; q-ary uniformly packed codes; regular q-ary codes; Code standards; Error correction codes; H infinity control; Linear code; Parity check codes; Vectors; Completely regular codes; Kronecker product; completely transitive codes; covering radius; intersection numbers; uniformly packed codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2009.2034812
Filename :
5361491
Link To Document :
