DocumentCode
3190796
Title
An efficient scheme to determine the weight distribution of binary (138, 69, 22) extended quadratic residue code
Author
Su, Wen-Ku ; Lee, Chong-Dao ; Truong, Trieu-Kien ; Chang, Yaotsu
Author_Institution
Dept. of Inf. Eng., I-Shou Univ., Dashu
fYear
2008
fDate
25-27 May 2008
Firstpage
38
Lastpage
40
Abstract
This paper utilizes an efficient scheme which consists of a weight-counting algorithm, the combinatorial designs of the Assmus-Mattson theorem, and the weight polynomial of Gleasonpsilas theorem to determine the weight distributions of binary extended quadratic residue codes. As a consequence, the weight distribution of binary (138, 69, 22) extended quadratic residue code is given.
Keywords
binary codes; residue codes; Assmus-Mattson theorem; Gleason theorem; binary extended quadratic residue codes; weight distribution; Algorithm design and analysis; Artificial intelligence; Books; Design engineering; Gold; Linear code; Mathematics; Parity check codes; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Circuits and Systems, 2008. ICCCAS 2008. International Conference on
Conference_Location
Fujian
Print_ISBN
978-1-4244-2063-6
Electronic_ISBN
978-1-4244-2064-3
Type
conf
DOI
10.1109/ICCCAS.2008.4657722
Filename
4657722
Link To Document