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

Celý popis

Podrobná bibliografia

Vydané v:	ITW : 2017 IEEE Information Theory Workshop : 6-10 November 2017 s. 269 - 273
Hlavní autori:	Zheng Wang, Cong Ling
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.11.2017
Predmet:	Conferences Convergence Correlation Gaussian distribution Information theory lattice coding and decoding Lattice Gaussian sampling Lattices Markov chain Monte Carlo Markov processes
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!