DocumentCode :
909141
Title :
Factorization of cyclic codes
Author :
Goethals, Jean-marie
Volume :
13
Issue :
2
fYear :
1967
fDate :
4/1/1967 12:00:00 AM
Firstpage :
242
Lastpage :
246
Abstract :
A subclass of cyclic codes of composite block length 
, with 
and 
relatively prime, is studied. It is shown how, under certain conditions, these codes may be factorized into subcodes of block length and and how they are related to codes of block length or , over extension fields of the base field. The problem is, in a sense, the converse of the one considered by Burton and Weldon, [5] and some of our codes are subcodes of their product codes. The factorization property gives better insight into the structure of various codes and allows, in particular, to obtain new lower bounds on their minimum weight, hence improving in many cases on the Bose-Chaudhuri bound.
, with and relatively prime, is studied. It is shown how, under certain conditions, these codes may be factorized into subcodes of block length and and how they are related to codes of block length or , over extension fields of the base field. The problem is, in a sense, the converse of the one considered by Burton and Weldon, [5] and some of our codes are subcodes of their product codes. The factorization property gives better insight into the structure of various codes and allows, in particular, to obtain new lower bounds on their minimum weight, hence improving in many cases on the Bose-Chaudhuri bound.fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1967.1054016
Filename :
1054016
Link To Document :
