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{Porter:2020:10.1109/ITW44776.2019.8989175,
author = {Porter, C and Lyu, S and Ling, C},
doi = {10.1109/ITW44776.2019.8989175},
pages = {185--189},
publisher = {IEEE},
title = {On the optimality of Gauss's algorithm over Euclidean imaginary quadratic Fields},
url = {http://dx.doi.org/10.1109/ITW44776.2019.8989175},
year = {2020}
}
Download

RIS format (EndNote, RefMan)

TY  - CPAPER
AB  - In this paper, we continue our previous work on the reduction of algebraic lattices over imaginary quadratic fields for the special case when the lattice is spanned over a two dimensional basis. In particular, we show that the algebraic variant of Gauss's algorithm returns a basis that corresponds to the successive minima of the lattice in polynomial time if the chosen ring is Euclidean.
AU  - Porter,C
AU  - Lyu,S
AU  - Ling,C
DO  - 10.1109/ITW44776.2019.8989175
EP  - 189
PB  - IEEE
PY  - 2020///
SN  - 2475-420X
SP  - 185
TI  - On the optimality of Gauss's algorithm over Euclidean imaginary quadratic Fields
UR  - http://dx.doi.org/10.1109/ITW44776.2019.8989175
UR  - http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000540384500038&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=1ba7043ffcc86c417c072aa74d649202
UR  - https://ieeexplore.ieee.org/abstract/document/8989175
ER  -
Download