Presentation 1996/7/26
On computing the minimun distance of linear block codes
Masami MOHRI, Masakatu MORII,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A class of linear code is very important as practical and theoretical points of view. For discussing the error performance analysis, we need the minimum distance. However, it is hard to compute the minimum distance when the linear code has a great many codewords. An efficient algorithm of computing the minimum distance of linear code is presented. The method is based upon the searching tree and using the property of parity check matrix for linear code. In this paper, we discuss the effect of the method, and suggest a efficient method by using some properties of trellis diagram.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) linear block codes / minimum distance / parity check matrix / code tree / trellis diagram
Paper # IT96-30
Date of Issue

Conference Information
Committee IT
Conference Date 1996/7/26(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 minimun distance of linear block codes
Sub Title (in English)
Keyword(1) linear block codes
Keyword(2) minimum distance
Keyword(3) parity check matrix
Keyword(4) code tree
Keyword(5) trellis diagram
1st Author's Name Masami MOHRI
1st Author's Affiliation Department of Management and Information Processing, Kagawa Junior College()
2nd Author's Name Masakatu MORII
2nd Author's Affiliation Department of Information Science and Intelligent Systems, Faculty of Engineering, The University of Tokushima
Date 1996/7/26
Paper # IT96-30
Volume (vol) vol.96
Number (no) 203
Page pp.pp.-
#Pages 6
Date of Issue