The Sectionalized Trellises with Fewest Edges of Linear Block Codes

  • Tang Yuansheng
    Graduate School of Information Science, Nara Institute of Science and Technology
  • Kasami Tadao
    Graduate School of Information Science, Nara Institute of Science and Technology
  • Fujiwara Toru
    Graduate School of Engineering Science, Osaka University

Bibliographic Information

Other Title
  • 線形ブロック符号における枝数最小のセクショントレリスについて

Search this article

Description

An algorithm for finding the optimal sectionalization for a trellis diagram with respect to distinct optimality criterions was presented by Lafourcade and Vardy. In this paper, for linear block codes, we give a method for finding the optimal sectionalized trellises directly from the TOGM of the code when the optimality criterion is chosen as the total number of the edges. A result on the expansion index, |E|-|V|+1, is also presented.

Journal

  • Technical report of IEICE. SST

    Technical report of IEICE. SST 97 (613), 117-120, 1998-03-18

    The Institute of Electronics, Information and Communication Engineers

Keywords

Details 詳細情報について

  • CRID
    1571135652406907008
  • NII Article ID
    110003289235
  • NII Book ID
    AN10345990
  • ISSN
    09135685
  • Text Lang
    ja
  • Data Source
    • CiNii Articles

Report a problem

Back to top