DocumentCode :
929598
Title :
Decomposition of cyclic codes of block lengths 
(Corresp.)
(Corresp.)Author :
MacWilliams, F. Jessie
Volume :
25
Issue :
1
fYear :
1979
fDate :
1/1/1979 12:00:00 AM
Firstpage :
112
Lastpage :
118
Abstract :
V. K. Bhargava recently made the following suggestion. Let 
he a cyclic code of dimension 
, and block length 
, where 
is a prime. It is sometimes possible to find a code equivalent to which has a generator matrix of the form ![[I|A_{1}| \\cdots |A_{t-1}]](/images/tex/3955.gif)
where each 
is a 
circulant matrix. Such a decomposition is useful in encoding and decoding and also in finding the weight distribution of . Some general theory as to
he a cyclic code of dimension , and block length , where is a prime. It is sometimes possible to find a code equivalent to which has a generator matrix of the form where each is a circulant matrix. Such a decomposition is useful in encoding and decoding and also in finding the weight distribution of . Some general theory as toKeywords :
Cyclic codes; Decoding; Encoding; Error correction codes; Error probability; Matrix decomposition; Welding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1979.1055992
Filename :
1055992
Link To Document :
