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{Lyu:2019:10.1109/ITW.2018.8613476,
author = {Lyu, S and Porter, C and Ling, C},
doi = {10.1109/ITW.2018.8613476},
pages = {480--484},
publisher = {Institute of Electrical and Electronics Engineers},
title = {Performance limits of lattice reduction over imaginary quadratic fields with applications to compute-and-forward},
url = {http://dx.doi.org/10.1109/ITW.2018.8613476},
year = {2019}
}
Download

RIS format (EndNote, RefMan)

TY  - CPAPER
AB  - Bases in the complex field, along with direct-sums defined by rings of imaginary quadratic integers, induce algebraic lattices. In this work, we examine the properties and reduction of such lattices. Focusing on algebraic Lenstra-Lenstra-Lovász (ALLL) reduction, we show that to satisfy Lovás condition requires the ring to be Euclidean. The proposed algorithm can be used to design network coding matrices in compute-and-forward (C & F).
AU  - Lyu,S
AU  - Porter,C
AU  - Ling,C
DO  - 10.1109/ITW.2018.8613476
EP  - 484
PB  - Institute of Electrical and Electronics Engineers
PY  - 2019///
SP  - 480
TI  - Performance limits of lattice reduction over imaginary quadratic fields with applications to compute-and-forward
UR  - http://dx.doi.org/10.1109/ITW.2018.8613476
UR  - http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000467849900097&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=1ba7043ffcc86c417c072aa74d649202
UR  - http://hdl.handle.net/10044/1/73542
ER  -
Download