Sciweavers

22 search results - page 1 / 5
» aaecc 2007
Sort
View
AAECC
2007
Springer
118views Algorithms» more  AAECC 2007»
15 years 6 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
AAECC
2007
Springer
113views Algorithms» more  AAECC 2007»
15 years 6 months ago
Generalized Sudan's List Decoding for Order Domain Codes
Abstract. We generalize Sudan’s list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the prop...
Olav Geil, Ryutaroh Matsumoto