111 search results - page 6 / 23 » From irreducible representations to locally decodable codes |
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
TIP
1998
13 years 7 months ago
1998
—In a standard transform coding scheme of images or video, the decoder can be implemented by a table-lookup technique without the explicit use of an inverse transformation. In th...
ISSS
2000
IEEE
13 years 12 months ago
2000
IEEE
Even though high-level hardware synthesis from dataflow graphs becomes popular in designing DSP systems, currently used dataflow models are inefficient to deal with emerging multi...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
TCOM
2010
13 years 5 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...