JaLCDOI 10.18926/14053
フルテキストURL Mem_Fac_Eng_OU_42_1.pdf
著者 Asatani Jun| 甲本 卓也| Toru Fujiwara| Tadao Kasami|
抄録 Two typical examples, the (32, 21, 6) and (64, 45, 8) extended code of primitive permuted BCH codes, are considered. The sets of minimum weight codewords are analyzed in terms of Boolean polynomial representation. They are classied by using their split weight structure with respect to the left and right half trellis sections, and for each class, the standard form is presented. Based on the results, we can generate a proper list of the minimum weight codewords of the codes.
キーワード Boolean polynomial representation extended BCH codes minimum weight codewords binary shift invariance property
出版物タイトル Memoirs of the Faculty of Engineering, Okayama University
発行日 2008-01
42巻
1号
開始ページ 1
終了ページ 9
ISSN 0475-0071
言語 English
論文のバージョン publisher
NAID 120002308333