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

Full description

Saved in:
Bibliographic Details
Published in:Proceedings / IEEE International Symposium on Information Theory pp. 2470 - 2474
Main Authors: Wang, Zheng, Ling, Cong
Format: Conference Proceeding Journal Article
Language:English
Published: IEEE 01.06.2015
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first