Heuristic algorithms for ordering a linear block code to reduce the number of nodes of the minimal trellis

A. Engelhart, J. Maucher, V. Sidorenko

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

We propose simple heuristic algorithms permuting the code positions of a linear block code to reduce the total number of nodes of the minimal trellis. Obtained results for some codes are presented.

Original languageEnglish
Title of host publicationProceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
Pages206
Number of pages1
DOIs
Publication statusPublished - 1998
Externally publishedYes
Event1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States
Duration: 16 Aug 199821 Aug 1998

Publication series

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

Conference

Conference1998 IEEE International Symposium on Information Theory, ISIT 1998
Country/TerritoryUnited States
CityCambridge, MA
Period16/08/9821/08/98

Fingerprint

Dive into the research topics of 'Heuristic algorithms for ordering a linear block code to reduce the number of nodes of the minimal trellis'. Together they form a unique fingerprint.

Cite this