このエントリーをはてなブックマークに追加
ID 14053
Eprint ID
14053
フルテキストURL
著者
Asatani Jun Faculty of Engineering Okayama University of Science
甲本 卓也 Graduate School of Natural Science and Technology, Okayama University
Toru Fujiwara Graduate School of Information Science and Technology, Osaka University
Tadao Kasami Graduate School of Information Science Nara Institute of Science and Technology
抄録
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
発行日
2008-01
出版物タイトル
Memoirs of the Faculty of Engineering, Okayama University
42巻
1号
出版者
Faculty of Engineering, Okayama University
出版者(別表記)
岡山大学工学部
開始ページ
1
終了ページ
9
ISSN
0475-0071
NCID
AA10699856
資料タイプ
紀要論文
言語
English
論文のバージョン
publisher
査読
無し
Eprints Journal Name
mfe