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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	ITW : 2017 IEEE Information Theory Workshop : 6-10 November 2017 S. 269 - 273
Hauptverfasser:	Zheng Wang, Cong Ling
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.11.2017
Schlagworte:	Conferences Convergence Correlation Gaussian distribution Information theory lattice coding and decoding Lattice Gaussian sampling Lattices Markov chain Monte Carlo Markov processes
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!