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

doi:10.1109/ISIT.1997.613299

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 proceeding › Conference contribution

1 Citation (Scopus)

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 language	English
Title of host publication	Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Pages	364
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.1997.613299
Publication status	Published - 1997
Externally published	Yes
Event	1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany Duration: Jun 29 1997 → Jul 4 1997

Publication series

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

Conference

Conference	1997 IEEE International Symposium on Information Theory, ISIT 1997
Country/Territory	Germany
City	Ulm
Period	6/29/97 → 7/4/97

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.1997.613299

Cite this

Kasami, T., Koumoto, T., Fujiwara, T., Yamamoto, H., & Lin, S. (1997). The structure and complexity of subtrellis diagrams for low weight codewords of binary linear block codes. In Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997 (pp. 364). Article 613299 (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.1997.613299

The structure and complexity of subtrellis diagrams for low weight codewords of binary linear block codes. / Kasami, Tadao; Koumoto, Takuya; Fujiwara, Toru et al.
Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997. 1997. p. 364 613299 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Kasami, T, Koumoto, T, Fujiwara, T, Yamamoto, H & Lin, S 1997, The structure and complexity of subtrellis diagrams for low weight codewords of binary linear block codes. in Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997., 613299, IEEE International Symposium on Information Theory - Proceedings, pp. 364, 1997 IEEE International Symposium on Information Theory, ISIT 1997, Ulm, Germany, 6/29/97. https://doi.org/10.1109/ISIT.1997.613299

@inproceedings{99ba07f3d3d346b9857a13f2f5cc2a6a,

title = "The 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 Koumoto and Toru Fujiwara and Hiroshi Yamamoto and Shu Lin",

year = "1997",

doi = "10.1109/ISIT.1997.613299",

language = "English",

isbn = "0780339568",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "364",

booktitle = "Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997",

note = "1997 IEEE International Symposium on Information Theory, ISIT 1997 ; Conference date: 29-06-1997 Through 04-07-1997",

}

TY - GEN

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

AU - Kasami, Tadao

AU - Koumoto, 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

U2 - 10.1109/ISIT.1997.613299

DO - 10.1109/ISIT.1997.613299

M3 - Conference contribution

AN - SCOPUS:0030710269

SN - 0780339568

SN - 9780780339569

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 364

BT - Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997

T2 - 1997 IEEE International Symposium on Information Theory, ISIT 1997

Y2 - 29 June 1997 through 4 July 1997

ER -

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

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this