DocumentCode :
923841
Title :
Equivalent rate 1/2 quasi-cyclic codes (Corresp.)
Author :
Stein, J.M. ; Bhargava, V.K.
Volume :
21
Issue :
5
fYear :
1975
fDate :
9/1/1975 12:00:00 AM
Firstpage :
588
Lastpage :
589
Abstract :
Chen et al. [1] give a list of quasi-cyclic (2m,m) codes which have the largest minimum distance of any quasi-cyclic code, for various values of m . We present the weight distribution of these codes. It will be seen that many of the codes found by Chen et al. [1] are equivalent in the sense of having identical weight distributions.
Keywords :
Cyclic codes; Algebra; Convolutional codes; Decoding; Distributed computing; Error correction codes; Interleaved codes; Polynomials; Redundancy; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1975.1055430
Filename :
1055430
Link To Document :
بازگشت