On the intractability of permuting a block code to minimize trellis complexity

An important problem in the theory and application of block code trellises is to find a coordinate permutation of a given code to minimize the trellis complexity. We show that the problem of finding a coordinate permutation that minimizes the number of vertices at a given depth in the minimal trelli...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 42; no. 6; pp. 2042 - 2048
Main Authors Horn, G.B., Kschischang, F.R.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.11.1996
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Binary system
Block codes
Codes
Communication system control
Decoding
Error analysis
Informatics
Information technology
Lattices
Linear code
NP-complete problem
Online AccessGet full text

Cover

More Information
Summary:An important problem in the theory and application of block code trellises is to find a coordinate permutation of a given code to minimize the trellis complexity. We show that the problem of finding a coordinate permutation that minimizes the number of vertices at a given depth in the minimal trellis for a binary linear block code is NP-complete.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/18.556701