Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
113
Voted
AAECC
2007
Springer
118
views
Algorithms
»
more
AAECC 2007
»
The "Art of Trellis Decoding" Is NP-Hard
15 years 9 months ago
Download
www.mast.queensu.ca
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
claim paper
Read More »