Sciweavers

52 search results - page 8 / 11
» Decoding Turbo-Like Codes via Linear Programming
Sort
View
DCC
2009
IEEE
14 years 8 months ago
An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources
We present a new lossy compressor for discrete sources. For coding a source sequence xn , the encoder starts by assigning a certain cost to each reconstruction sequence. It then f...
Shirin Jalali, Andrea Montanari, Tsachy Weissman
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 7 months ago
Rate-Distortion via Markov Chain Monte Carlo
We propose an approach to lossy source coding, utilizing ideas from Gibbs sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is to sample a reconstructio...
Shirin Jalali, Tsachy Weissman
IPL
2010
114views more  IPL 2010»
13 years 6 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
PADL
2007
Springer
14 years 1 months ago
Applications, Implementation and Performance Evaluation of Bit Stream Programming in Erlang
Writing code that manipulates bit streams is a painful and error-prone programming task, often performed via bit twiddling techniques such as explicit bit shifts and bit masks in p...
Per Gustafsson, Konstantinos F. Sagonas
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin