The structure and complexity of subtrellis diagrams for low weight codewords of binary linear block codes

Tadao Kasami, Takuya Koumoto, Toru Fujiwara, Hiroshi Yamamoto, Shu Lin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper investigates the structure and complexity of low-weight subtrellises for binary linear block codes. The state and branch complexities of low-weight subtrellises for Reed-Muller (RM) codes and some extended permuted BCH (EBCH) codes are given.

Original languageEnglish
Title of host publicationProceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Pages364
Number of pages1
DOIs
Publication statusPublished - 1997
Externally publishedYes
Event1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany
Duration: Jun 29 1997Jul 4 1997

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1997 IEEE International Symposium on Information Theory, ISIT 1997
CountryGermany
CityUlm
Period6/29/977/4/97

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The structure and complexity of subtrellis diagrams for low weight codewords of binary linear block codes'. Together they form a unique fingerprint.

Cite this