Imperial College London
Alternate

DrCongLing

Faculty of Engineering, Department of Electrical and Electronic Engineering

Reader in Coding and Information Theory
 
 
 
//

Contact

 

+44 (0)20 7594 6214c.ling

 
 
//

Location

 

815Electrical EngineeringSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@inproceedings{Wang:2016:10.1109/ISIT.2016.7541634,
author = {Wang, Z and Ling, C},
doi = {10.1109/ISIT.2016.7541634},
publisher = {IEEE},
title = {Further results on independent Metropolis-Hastings-Klein sampling},
url = {http://dx.doi.org/10.1109/ISIT.2016.7541634},
year = {2016}
}
Download

RIS format (EndNote, RefMan)

TY  - CPAPER
AB  - Sampling from a lattice Gaussian distribution is emerging as an important problem in coding and cryptography. This paper gives a further analysis of the independent Metropolis-Hastings-Klein (MHK) algorithm we presented at ISIT 2015. We derive the exact spectral gap of the induced Markov chain, which dictates the convergence rate of the independent MHK algorithm. Then, we apply the independent MHK algorithm to lattice decoding and obtained the decoding complexity for solving the CVP as O(eBx-c2 / mini bi2). Finally, the tradeoff between decoding radius and complexity is also established.
AU  - Wang,Z
AU  - Ling,C
DO  - 10.1109/ISIT.2016.7541634
PB  - IEEE
PY  - 2016///
SN  - 2157-8117
TI  - Further results on independent Metropolis-Hastings-Klein sampling
UR  - http://dx.doi.org/10.1109/ISIT.2016.7541634
UR  - http://hdl.handle.net/10044/1/40322
ER  -
Download