Achievable Refined Asymptotics for Successive Refinement Using Gaussian Codebooks
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2023.3244232
Abstract: We study the mismatched successive refinement problem where one uses Gaussian codebooks to compress an arbitrary memoryless source with successive minimum Euclidean distance encoding under the quadratic distortion measure. Specifically, we derive achievable refined asymptotics… read more here.
Keywords: codebook; refined asymptotics; successive refinement; gaussian codebooks ... See more keywords