On the Geometric Ergodicity of Metropolis-Hastings Algorithms for Lattice Gaussian Sampling
From MaRDI portal
Publication:4566663
DOI10.1109/TIT.2017.2742509zbMath1390.60274arXiv1501.05757MaRDI QIDQ4566663
Publication date: 27 June 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.05757
Computational methods in Markov chains (60J22) Sampling theory, sample surveys (62D05) Sampling theory in information and communication theory (94A20)
This page was built for publication: On the Geometric Ergodicity of Metropolis-Hastings Algorithms for Lattice Gaussian Sampling