このエントリーをはてなブックマークに追加
ID 14053
Eprint ID
14053
FullText URL
Author
Asatani Jun
Koumoto, Takuya
Toru Fujiwara
Tadao Kasami
Abstract
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.
Keywords
Boolean polynomial representation
extended BCH codes
minimum weight codewords
binary shift invariance property
Published Date
2008-01
Publication Title
Memoirs of the Faculty of Engineering, Okayama University
Volume
volume42
Issue
issue1
Publisher
Faculty of Engineering, Okayama University
Publisher Alternative
岡山大学工学部
Start Page
1
End Page
9
ISSN
0475-0071
NCID
AA10699856
Content Type
Departmental Bulletin Paper
language
英語
File Version
publisher
Refereed
False
Eprints Journal Name
mfe