Presentation 2008-07-25
On Computing the Weight Distribution of High Rate Binary Cyclic Codes
Yasuo ASAKURA, Masami MOHRI, Masakatu MORII,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The weight distribution is very important parameters which are necessary to evaluate the performance of the codes, and computing the minimum weight d and the number of codewords with minimum weight A_d are very significant. In this paper,we discuss with n-sparse algorithm by Tanaka, Mohri, and Morii, and we propose an efficient method to computing the minimum codewords of high rate binary cyclic codes in a short time.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) cyclic codes / weight distribution / B-D algorithm
Paper # IT2008-19
Date of Issue

Conference Information
Committee IT
Conference Date 2008/7/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Computing the Weight Distribution of High Rate Binary Cyclic Codes
Sub Title (in English)
Keyword(1) cyclic codes
Keyword(2) weight distribution
Keyword(3) B-D algorithm
1st Author's Name Yasuo ASAKURA
1st Author's Affiliation Graduate School of Engineering, Kobe University()
2nd Author's Name Masami MOHRI
2nd Author's Affiliation Information and Multimedia Center, Gifu University
3rd Author's Name Masakatu MORII
3rd Author's Affiliation Graduate School of Engineering, Kobe University
Date 2008-07-25
Paper # IT2008-19
Volume (vol) vol.108
Number (no) 159
Page pp.pp.-
#Pages 6
Date of Issue