111 search results - page 7 / 23 » From irreducible representations to locally decodable codes |
DCC
1996
IEEE
14 years 2 months ago
1996
IEEE
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
SECON
2008
IEEE
14 years 4 months ago
2008
IEEE
—In this paper, BFLY–a practical localized network coding protocol for wireless mesh networks–is proposed. To supplement forwarding packets in classical networks, intermediat...
DCC
2001
IEEE
14 years 9 months ago
2001
IEEE
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
ICIP
2006
IEEE
14 years 11 months ago
2006
IEEE
Disparity estimation has been widely studied in the literature of stereo matching and coding. However, how to shift disparity estimation from encoder to decoder to support distrib...