• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Fast decoding methods of algebraic geometry codes and generalized algebraic geometry codes

Research Project

Project/Area Number 16560323
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Communication/Network engineering
Research InstitutionThe University of Electro-Communications

Principal Investigator

SAKATA Shojiro  The University of Electro-Communications, Faculty of Electro-Communications, Professor, 電気通信学部, 教授 (20064157)

Co-Investigator(Kenkyū-buntansha) KURIHARA Masazumi  The University of Electro-Communications, Faculty of Electro-Communications, Research Assistant, 電気通信学部, 助手 (90242346)
FUJISAWA Masaya  The Tokyo University of Science, Faculty of Engineering, Research Assistant, 第二工学部, 助手 (10345431)
Project Period (FY) 2004 – 2006
Project Status Completed (Fiscal Year 2006)
Budget Amount *help
¥3,500,000 (Direct Cost: ¥3,500,000)
Fiscal Year 2006: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 2005: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 2004: ¥1,900,000 (Direct Cost: ¥1,900,000)
Keywordsinformation and communication engineering / algebra / algebraic geometry code / fast decoding method / BMS algorithm / generalized algebraic geometry code / list decoding / error-correcting code / 補間多項式と因数分解 / Berlekamp-Masseyアルゴリズム / 複数配列に対するBMアルゴリズム
Research Abstract

The objective of this research is to develop efficient algorithms for decoding not only algebraic geometric (AG) codes but also generalized algebraic geometric (GAG) codes and furthermore aim at systematizing past and new research results of fast decoding methods for those codes so that these decoding methods can be used practically in digital communication systems in the highly information-technological world in near future.
As outcomes of our researches, we have clarified several relations among fast decoding methods of those codes. In particular, we have shown that the parallel Berlekamp-Massey (BM) algorithm and Euclidean algorithm for decoding are identical, and that the multiple-sequence BM algorithm can be replaced by a succession of single-sequence BM algorithm. Furthermore, we have shown that the Welch-Belekamp algorithim can be realized as a vectorial version of BM algorithm. We presented these results in the 2004 International Symposium on Information Theory and Applications (ISITA-2004), in Parma, Italy, October 10-13, 2004, in the IEEE 2005 International Symposium on Information Theory, in Adelaide, Australia, September 4-9, 2005, and in the 2006 International Symposium on Information Theory and Applications (ISITA-2006), in Seoul, Korea, October 29-November 1, 2006, respectively. Related to the research, we published a textbook on Coding Theory entitled Introduction to Error-Correcting Codes which is a Japanese translation of A Course in Error-Correcting Codes by J.Justesen, and T.Hoeholdt published by European Mathematical Society, in 2004, as well as a paper entitled "Systolic array architecture implementing Berlekamp-Massey-Sakata algorithm for decoding codes on a class of algebraic curves" in IEEE Transactions on Information Theory, in 2005. In 2006, we had several tutorial lectures to give a grand survey of past and new results of our researches on fast decoding of AG codes.

Report

(4 results)
  • 2006 Annual Research Report   Final Research Report Summary
  • 2005 Annual Research Report
  • 2004 Annual Research Report
  • Research Products

    (17 results)

All 2006 2005 2004

All Journal Article (15 results) Book (2 results)

  • [Journal Article] A comparison between WB algorithm and BM algorithm2006

    • Author(s)
      S.Sakata, M.Fujisawa
    • Journal Title

      Proceedings of 2006 International Symposium on Information Theory and its Applications (ISITA-2006) (CD-ROM)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2006 Final Research Report Summary
  • [Journal Article] 代数的符号理論 : 夢と現実2006

    • Author(s)
      阪田省二郎
    • Journal Title

      電子情報通信学会技術報告 IT2006-49

      Pages: 25-32

    • NAID

      110005717397

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2006 Annual Research Report 2006 Final Research Report Summary
  • [Journal Article] Codes, arrays, Grobner bases(Ed.T.Hibi)2006

    • Author(s)
      S.Sakata
    • Journal Title

      Contemporary Grobner Bases(Sugaku-Shobou) § 6

      Pages: 128-152

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2006 Final Research Report Summary
  • [Journal Article] A comparison between WB algorithm and BM algorithm (Eds.H.Chung, T.Fujiwara)2006

    • Author(s)
      S.Sakata, M.Fujisawa
    • Journal Title

      Proceedings of 2006 International Symposium on Information Theory and its Applications(ISITA-2006)(Seoul. Korea) 10-13(CD-ROM)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2006 Final Research Report Summary
  • [Journal Article] Algebraic Coding Theory : Dreams and Realities2006

    • Author(s)
      S.Sakata
    • Journal Title

      Technical Notes of IEICE(in Japanese) IT2006-49

      Pages: 25-32

    • NAID

      110005717397

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2006 Final Research Report Summary
  • [Journal Article] A comparison between WB algorithm and BM algorithm.2006

    • Author(s)
      S.Sakata, M.FUjisawa
    • Journal Title

      Proceedings of 2006 International Symposium on Information Theory and its Applications (ISITA-2006) (CD-ROM)

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Multiple-sequence BM algorithm can be replaced by a succession of single-sequence BM algorithm2005

    • Author(s)
      S.Sakata
    • Journal Title

      Proceedings of 2005 IEEE International Symposium on Information Theory (ISIT-2005)(Adelaide, Australia) 4-9(CD-ROM)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2006 Final Research Report Summary
  • [Journal Article] A class of quasi-cyclic regular LDPC codes from cyclic-deifference family2005

    • Author(s)
      M.Fujisawa, S.Sakata
    • Journal Title

      Proceedings of 2005 IEEE International Symposium on Information Theory(ISIT-2005)(Adelaide, Australia) 4-9(CD-ROM)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2006 Final Research Report Summary
  • [Journal Article] Introduction to Error-Correcting Codes2005

    • Author(s)
      S.Sakata, M.Kurihara, H.Matsui, M.Fujisawa
    • Journal Title

      A Course in Error-Correcting Codes, European Mathematical Society,2004(Morikita Publishing Co.)(A Japanese translation : J.Justesen, T.Hoeholdt)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2006 Final Research Report Summary
  • [Journal Article] Systolic array architecture implementing Berlekamp-Massey-Sakata algorithm for decodeing codes on a class of algebraic curves2005

    • Author(s)
      H.Matsui, S.Sakata, M.Kurihara, S.Mita
    • Journal Title

      IEEE Transactions on Information Theory 51

      Pages: 3856-3871

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2006 Final Research Report Summary
  • [Journal Article] Multiple-sequence BM Algorithm can be replaced by a succession of single-sequence BM algorithm2005

    • Author(s)
      S.Sakata
    • Journal Title

      Proceedings of 2005 IEEE International Symposium on Information Theory

      Pages: 55-55

    • Related Report
      2005 Annual Research Report
  • [Journal Article] A Class of quasi-cyclic regular LDPC codes derived from cyclic difference families with girth 82005

    • Author(s)
      M.Fujisawa, S.Sakata
    • Journal Title

      Proceedings of 2005 IEEE International symposium on Information Theory

      Pages: 64-64

    • Related Report
      2005 Annual Research Report
  • [Journal Article] Systolic array architecture implementing Berlekamp-Masssey-Sakata algorithm for decoding codes on a class of algebraic curves2005

    • Author(s)
      H.Matsui, S.Sakata, M.Kurihara, S.Mita
    • Journal Title

      IEEE Transactions on Information Theory 51

      Pages: 3856-3871

    • Related Report
      2005 Annual Research Report
  • [Journal Article] Parallel BM algorithm and Euclidean algorithm for decoding are identical.2004

    • Author(s)
      S.Sakata
    • Journal Title

      Proceedings of 2004 International Symposium on Information Theory and its Applications(ISITA-2004)(Parma, Italy) (D-ROM)

      Pages: 1462-1467

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2006 Final Research Report Summary
  • [Journal Article] Parallel BM altorithm and Euclidean algorithm for decoding are identical.2004

    • Author(s)
      S.Sakata
    • Journal Title

      Proc.ISITA-2004 (CD-ROM)

    • Related Report
      2004 Annual Research Report
  • [Book] 「グレブナー基底の現在」第6章 : 符号・配列・グレブナー基底(日比孝之(編))2006

    • Author(s)
      阪田省二郎
    • Publisher
      数学書房
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2006 Annual Research Report 2006 Final Research Report Summary
  • [Book] 誤り訂正符号入門2005

    • Author(s)
      阪田, 栗原, 松井, 藤沢(共訳)
    • Total Pages
      207
    • Publisher
      森北出版株式会社
    • Related Report
      2005 Annual Research Report

URL: 

Published: 2004-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi