Sciweavers

AAECC
2007
Springer
118views Algorithms» more  AAECC 2007»
13 years 10 months ago
The "Art of Trellis Decoding" Is NP-Hard
Given a linear code C, the fundamental problem of trellis decoding is to find a coordinate permutation of C that yields a code C′ whose minimal trellis has the least state-compl...
Navin Kashyap