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

Tadao Kasami, Takuya Kusaka, 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 publicationIEEE International Symposium on Information Theory - Proceedings
PublisherIEEE
Pages364
Number of pages1
Publication statusPublished - 1997
Externally publishedYes
EventProceedings of the 1997 IEEE International Symposium on Information Theory - Ulm, Ger
Duration: Jun 29 1997Jul 4 1997

Other

OtherProceedings of the 1997 IEEE International Symposium on Information Theory
CityUlm, Ger
Period6/29/977/4/97

Fingerprint

Block Codes
Block codes
Linear Codes
Diagram
Binary
BCH Codes
Reed-Muller Codes
Branch

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Applied Mathematics
  • Modelling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Kasami, T., Kusaka, T., Fujiwara, T., Yamamoto, H., & Lin, S. (1997). Structure and complexity of subtrellis diagrams for low weight codewords of binary linear block codes. In IEEE International Symposium on Information Theory - Proceedings (pp. 364). IEEE.

Structure and complexity of subtrellis diagrams for low weight codewords of binary linear block codes. / Kasami, Tadao; Kusaka, Takuya; Fujiwara, Toru; Yamamoto, Hiroshi; Lin, Shu.

IEEE International Symposium on Information Theory - Proceedings. IEEE, 1997. p. 364.

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

Kasami, T, Kusaka, T, Fujiwara, T, Yamamoto, H & Lin, S 1997, Structure and complexity of subtrellis diagrams for low weight codewords of binary linear block codes. in IEEE International Symposium on Information Theory - Proceedings. IEEE, pp. 364, Proceedings of the 1997 IEEE International Symposium on Information Theory, Ulm, Ger, 6/29/97.
Kasami T, Kusaka T, Fujiwara T, Yamamoto H, Lin S. Structure and complexity of subtrellis diagrams for low weight codewords of binary linear block codes. In IEEE International Symposium on Information Theory - Proceedings. IEEE. 1997. p. 364
Kasami, Tadao ; Kusaka, Takuya ; Fujiwara, Toru ; Yamamoto, Hiroshi ; Lin, Shu. / Structure and complexity of subtrellis diagrams for low weight codewords of binary linear block codes. IEEE International Symposium on Information Theory - Proceedings. IEEE, 1997. pp. 364
@inproceedings{99ba07f3d3d346b9857a13f2f5cc2a6a,
title = "Structure and complexity of subtrellis diagrams for low weight codewords of binary linear block codes",
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.",
author = "Tadao Kasami and Takuya Kusaka and Toru Fujiwara and Hiroshi Yamamoto and Shu Lin",
year = "1997",
language = "English",
pages = "364",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - Structure and complexity of subtrellis diagrams for low weight codewords of binary linear block codes

AU - Kasami, Tadao

AU - Kusaka, Takuya

AU - Fujiwara, Toru

AU - Yamamoto, Hiroshi

AU - Lin, Shu

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030710269&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030710269&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0030710269

SP - 364

BT - IEEE International Symposium on Information Theory - Proceedings

PB - IEEE

ER -