DocumentCode :
1829198
Title :
On the Efficient Codewords Counting Algorithm and the Weight Distributions of the Binary Quadratic Double-Circulant Codes
Author :
Tjhai, C. ; Tomlinson, M. ; Horan, R. ; Ahmed, M. ; Ambroze, M.
Author_Institution :
Fixed & Mobile Commun. Res., Plymouth Univ.
fYear :
2006
fDate :
22-26 Oct. 2006
Firstpage :
42
Lastpage :
46
Abstract :
An efficient algorithm to count all codewords of given weight and a method to deduce the modular congruence of the weight distributions of the binary quadratic double-circulant codes are presented. Using this algorithm, we give the weight distribution of the quadratic double-circulant code of length 168 and that of the extended quadratic-residue code of the same length. The weight distributions of these two inequivalent codes of length 168, which were previously unknown, are independently verified and proved to be accurate using the modular congruence method
Keywords :
binary codes; binary quadratic double-circulant codes; codewords counting algorithm; modular congruence method; quadratic-residue code; weight distributions; Concurrent computing; Conferences; Distributed computing; Information theory; Linear code; Mobile communication; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop, 2006. ITW '06 Chengdu. IEEE
Conference_Location :
Chengdu
Print_ISBN :
1-4244-0067-8
Electronic_ISBN :
1-4244-0068-6
Type :
conf
DOI :
10.1109/ITW2.2006.323750
Filename :
4119251
Link To Document :
بازگشت