2元線形ブロック符号に対するグレブナ基底を用いた最尤復号法の計算量(一般,フレッシュマン,招待講演)  [in Japanese] Complexity of a Maximum Likelihood Decoding Algorithm Based on Grobner Bases for Binary Linear Block Codes  [in Japanese]

    • 池上 大介 IKEGAMI Daisuke
    • 科学技術振興事業団戦略的創造研究推進事業CRESTプログラム産業技術総合研究所システム検証研究ラボ Japan Science and Technology corporation CREST program National Institute of Advanced Industrial Science and Technology Laboratory for Verification and Semantics

Abstract

本稿では,著者によって提案されているグレブナ基底を用いた最尤復号法について議論する.この最尤復号法は軟判定ならびに硬判定に適用することができるが,どちらの場合においても計算量の評価はなされていなかった.この最尤復号法の計算量はグレブナ基底の個数によって決まるので,本研究ではグレブナ基底の個数の上界を与える.

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.

Journal

IEICE technical report. Information theory   [List of Volumes]

IEICE technical report. Information theory 103(215), 33-37, 2003-07-16  [Table of Contents]

The Institute of Electronics, Information and Communication Engineers

References:  12

You must have a user ID to see the references.If you already have a user ID, please click "Login" to access the info.New users can click "Sign Up" to register for an user ID.

Preview

Preview

Codes

  • NII Article ID (NAID) :
    110003177802
  • NII NACSIS-CAT ID (NCID) :
    AN10013083
  • Text Lang :
    JPN
  • Article Type :
    ART
  • ISSN :
    09135685
  • NDL Article ID :
    6676426
  • NDL Source Classification :
    ZN33(科学技術--電気工学・電気機械工業--電子工学・電気通信)
  • NDL Call No. :
    Z16-940
  • Databases :
    CJP  NDL  NII-ELS 

Export