Sciweavers

91 search results - page 15 / 19
» Some Soft-Decision Decoding Algorithms for Reed-Solomon Code...
Sort
View
ECCC
2010
122views more  ECCC 2010»
14 years 8 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
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
15 years 3 months ago
Tolerant Locally Testable Codes
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...
Venkatesan Guruswami, Atri Rudra
CISS
2008
IEEE
15 years 4 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
TWC
2010
14 years 4 months ago
Toward network coding-based protocols for data broadcasting in wireless Ad Hoc networks
In this paper we consider practical dissemination algorithms exploiting network coding for data broadcasting in ad hoc wireless networks. For an efcient design, we analyze issues r...
Alfred Asterjadhi, Elena Fasolo, Michele Rossi, J&...
TSP
2008
118views more  TSP 2008»
14 years 9 months ago
Analytical Rate-Distortion-Complexity Modeling of Wavelet-Based Video Coders
Analytical modeling of the performance of video coders is essential in a variety of applications, such as power-constrained processing, complexity-driven video streaming, etc., whe...
Brian Foo, Yiannis Andreopoulos, Mihaela van der S...