6 problems

MDLVQ optimality conjecture. The algorithm, with an appropriate local adjustment, is also optimal for any values of $K$ and $N$.

Universal MDLVQ index-assignment conjecture. The combined use of the greedy algorithm and local adjustment $\Rsh(a,b)$ solves the problem of optimal MDLVQ index assignment for any…

Finite-index optimality conjecture. For $K>2$, the local adjustment algorithm augmenting the greedy index assignment is conjectured to be optimal for finite $N$.

Consider a multiple-description lattice vector quantization system with $K$ descriptions, and let the side distortions be evaluated in the high-resolution regime as the lattice dim…

Let $K$ be the number of descriptions, let $L$ be the lattice dimension, and let $N$ and $us$ be the system parameters in the paper. For each pair of distinct description indices…

Consider a symmetric $n$-channel multiple-description lattice vector quantization system under the high-resolution assumptions, with side distortions determined by the lattice scal…