184 search results - page 19 / 37 » Query Complexity Lower Bounds for Reconstruction of Codes |
ICMCS
2007
IEEE
14 years 2 months ago
2007
IEEE
In inter-picture coding, block-based frequency transform is usually carried out on the predicted errors for each interblock to remove the spatial correlation among them. However, ...
TIT
1998
13 years 7 months ago
1998
—A sequential decoder for linear block codes that performs maximum-likelihood soft-decision decoding is described. The decoder uses a metric computed from a lower bound on the co...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper proposes a novel algorithm for decoding real-field codes over erroneous channels, where the encoded message is corrupted by sparse errors, i.e., impulsive noise. The m...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...
VLDB
1997
ACM
14 years 17 hour ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...