On the geometric ergodicity of Gibbs algorithm for lattice Gaussian sampling

Sampling from the lattice Gaussian distribution is emerging as an important problem in coding and cryptography. In this paper, the conventional Gibbs sampling algorithm is demonstrated to be geometrically ergodic in tackling with lattice Gaussian sampling, which means its induced Markov chain conver...

Full description

Bibliographic Details

Published in:	ITW : 2017 IEEE Information Theory Workshop : 6-10 November 2017 pp. 269 - 273
Main Authors:	Zheng Wang, Cong Ling
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2017
Subjects:	Conferences Convergence Correlation Gaussian distribution Information theory lattice coding and decoding Lattice Gaussian sampling Lattices Markov chain Monte Carlo Markov processes
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!