Presentation 2003/7/16
Complexity of a Maximum Likelihood Decoding Algorithm Based on Grobner Bases for Binary Linear Block Codes
Daisuke IKEGAMI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we have studied a maximum likelihood decoding for binary linear block codes based on Grobner bases which is proposed by the author. The decoding algorithm can be applied both the soft-decision and the hard-decision, however, the complexity of the algorithm had not been known. Since the complexity can be estimated by the number of the Grobner bases, we investigate the size of bases in the decoding algorithm and give an upper bound.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) maximum likelihood decoding / block code / soft decision / hard decision / Grobner basis
Paper # IT2003-29
Date of Issue

Conference Information
Committee IT
Conference Date 2003/7/16(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) Complexity of a Maximum Likelihood Decoding Algorithm Based on Grobner Bases for Binary Linear Block Codes
Sub Title (in English)
Keyword(1) maximum likelihood decoding
Keyword(2) block code
Keyword(3) soft decision
Keyword(4) hard decision
Keyword(5) Grobner basis
1st Author's Name Daisuke IKEGAMI
1st Author's Affiliation Japan Science and Technology corporation CREST program National Institute of Advanced Industrial Science and Technology Laboratory for Verification and Semantics()
Date 2003/7/16
Paper # IT2003-29
Volume (vol) vol.103
Number (no) 215
Page pp.pp.-
#Pages 5
Date of Issue