An Efficient Searching Tree Algorithm for Computing the Number of Codewords with Minimum Weight of Binary Linear Codes

• TAKETA Atsushi

  Dept. of Information Science and Intelligent Systems, Faculty of Engineering, The University of Tokushima

• MOHRI Masami

  Dept. of Information Science and Intelligent Systems, Faculty of Engineering, The University of Tokushima

• MORII Masakatu

  Dept. of Information Science and Intelligent Systems, Faculty of Engineering, The University of Tokushima

Bibliographic Information

Other Title

• 2元(n, κ)線形符号の最小重みを効率的に求める木探索アルゴリズムについて

Journal

• 情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications

  情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications 26 (2), 465-468, 2003-12-15

Keywords

• minimum weight
• weight distribution
• binary linear codes
• searching tree
• parity check matrix

Details

• CRID: 1573668924862240000
• NII Article ID: 10013957770
• NII Book ID: AA11796188
• Text Lang: ja
• Data Source:
  • CiNii Articles