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

A. Engelhart; J. Maucher; V. Sidorenko

doi:10.1109/ISIT.1998.708807

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

1 Scopus citations

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 language	English
Title of host publication	Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
Pages	206
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.1998.708807
State	Published - 1998
Externally published	Yes
Event	1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States Duration: 16 Aug 1998 → 21 Aug 1998

Publication series

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

Conference

Conference	1998 IEEE International Symposium on Information Theory, ISIT 1998
Country/Territory	United States
City	Cambridge, MA
Period	16/08/98 → 21/08/98

Access to Document

10.1109/ISIT.1998.708807

Cite this

Engelhart, A., Maucher, J., & Sidorenko, V. (1998). Heuristic algorithms for ordering a linear block code to reduce the number of nodes of the minimal trellis. In Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998 (pp. 206). Article 708807 (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.1998.708807

@inproceedings{9d1a11cb6e954f628c432233e7b3283d,

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

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.",

author = "A. Engelhart and J. Maucher and V. Sidorenko",

year = "1998",

doi = "10.1109/ISIT.1998.708807",

language = "English",

isbn = "0780350006",

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

pages = "206",

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

note = "1998 IEEE International Symposium on Information Theory, ISIT 1998 ; Conference date: 16-08-1998 Through 21-08-1998",

}

Engelhart, A, Maucher, J & Sidorenko, V 1998, Heuristic algorithms for ordering a linear block code to reduce the number of nodes of the minimal trellis. in Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998., 708807, IEEE International Symposium on Information Theory - Proceedings, pp. 206, 1998 IEEE International Symposium on Information Theory, ISIT 1998, Cambridge, MA, United States, 16/08/98. https://doi.org/10.1109/ISIT.1998.708807

Heuristic algorithms for ordering a linear block code to reduce the number of nodes of the minimal trellis. / Engelhart, A.; Maucher, J.; Sidorenko, V.
Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998. 1998. p. 206 708807 (IEEE International Symposium on Information Theory - Proceedings).

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

TY - GEN

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

AU - Engelhart, A.

AU - Maucher, J.

AU - Sidorenko, V.

PY - 1998

Y1 - 1998

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

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

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

U2 - 10.1109/ISIT.1998.708807

DO - 10.1109/ISIT.1998.708807

M3 - Conference contribution

AN - SCOPUS:0004858132

SN - 0780350006

SN - 9780780350007

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 206

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

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

Y2 - 16 August 1998 through 21 August 1998

ER -

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this