Independent Metropolis-Hastings-Klein algorithm for lattice Gaussian sampling

Sampling from the lattice Gaussian distribution is emerging as an important problem in coding and cryptography. In this paper, a Markov chain Monte Carlo (MCMC) algorithm referred to as the independent Metropolis-Hastings-Klein (MHK) algorithm is proposed for lattice Gaussian sampling, which overcom...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Proceedings / IEEE International Symposium on Information Theory s. 2470 - 2474
Hlavní autori:	Wang, Zheng, Ling, Cong
Médium:	Konferenčný príspevok.. Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 01.06.2015
Predmet:	Algorithm design and analysis Algorithms Convergence Decoding Gaussian Gaussian distribution lattice coding and decoding Lattice Gaussian sampling Lattices Markov chains Markov processes Mathematical analysis MCMC methods Metropolis-Hastings sampling Proposals Sampling Standard deviation
ISSN:	2157-8095, 2157-8117
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!