Algorithmic complexity in coding theory and the minimum distance problem
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Ordered Binary Decision Diagrams and Minimal Trellises
IEEE Transactions on Computers
Trellis Structure and Higher Weights of Extremal Self-Dual Codes
Designs, Codes and Cryptography
A Posteriory Probability Decoding of Nonsystematically Encoded Block Codes
Problems of Information Transmission
The "Art of trellis decoding" is NP-hard
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
| Hi-index | 0.00 |
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