(1 + ε)-approximate sparse recovery
Eric Price, David P. Woodruff
FOCS 2011
The Q-Coder is a new form of adaptive binary arithmetic coding. The binary arithmetic coding part of the technique is derived from the basic concepts introduced by Rissanen, Pasco, and Langdon, but extends the coding conventions to resolve a conflict between optimal software and hardware implementations. A robust form of probability estimation is used in which the probability estimate is derived solely from the interval renormalizations that are part of the arithmetic coding process. A tutorial of arithmetic coding concepts is presented, followed by a discussion of the compatible optimal hardware and software coding structures and the estimation of symbol probabilities from interval renormalization.
Eric Price, David P. Woodruff
FOCS 2011
Qing Li, Zhigang Deng, et al.
IEEE T-MI
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013