Sciweavers

212 search results - page 10 / 43
» On the Locality of Codeword Symbols
Sort
View
IS
2008
13 years 8 months ago
A dimensionality reduction technique for efficient time series similarity analysis
We propose a dimensionality reduction technique for time series analysis that significantly improves the efficiency and accuracy of similarity searches. In contrast to piecewise c...
Qiang Wang, Vasileios Megalooikonomou
CORR
2007
Springer
138views Education» more  CORR 2007»
13 years 8 months ago
Low Density Lattice Codes
— Low density lattice codes (LDLC) are novel lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC...
Naftali Sommer, Meir Feder, Ofir Shalvi
ICIP
2010
IEEE
13 years 6 months ago
Distributed joint source-channel arithmetic coding
We deal with the problem of distributed source coding with decoder side information, when the decoder observes the source through a noisy channel. Existing approaches employ syndr...
Marco Grangetto, Enrico Magli, Gabriella Olmo
JSAC
2010
132views more  JSAC 2010»
13 years 3 months ago
Very Efficient Balanced Codes
The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated...
K. Schouhamer Immink, J. Weber
ECCC
2010
122views more  ECCC 2010»
13 years 7 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah