Performance Limits of Lattice Reduction over Imaginary Quadratic Fields with Applications to Compute-and-Forward

被引：0

作者：

Lyu, Shanxiang ^{[1
]}

Porter, Christian ^{[1
]}

Ling, Cong ^{[1
]}

机构：

[1] Imperial Coll London, Dept EEE, London SW7 2AZ, England

来源：

2018 IEEE INFORMATION THEORY WORKSHOP (ITW) | 2018年

关键词：

lattice reduction; algebraic; compute-and-forward;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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-Lovasz (ALLL) reduction, we show that to satisfy Lovasz'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).

引用

下载

页码：480 / 484

页数：5

共 50 条

[21] REDUCTION OF ELLIPTIC-CURVES OVER IMAGINARY QUADRATIC NUMBER-FIELDS
STROEKER, RJ
PACIFIC JOURNAL OF MATHEMATICS, 1983, 108 (02) : 451 - 463
[22] On a family of cubics over imaginary quadratic fields
Ziegler V.
Periodica Mathematica Hungarica, 2005, 51 (2) : 109 - 130
[23] Theta functions of quadratic forms over imaginary quadratic fields
Richter, OK
ACTA ARITHMETICA, 2000, 92 (01) : 1 - 9
[24] Sign functions of imaginary quadratic fields and applications
Oukhaba, H
ANNALES DE L INSTITUT FOURIER, 2005, 55 (03) : 753 - +
[25] Outage Performance for Compute-and-Forward in Generalized Multi-Way Relay Channels
Wang, Gengkun
Xiang, Wei
Yuan, Jinhong
IEEE COMMUNICATIONS LETTERS, 2012, 16 (12) : 2099 - 2102
[26] NONEXISTENCE OF ELLIPTIC CURVES WITH EVERYWHERE GOOD REDUCTION OVER CERTAIN IMAGINARY QUADRATIC FIELDS
ISHII, H
JOURNAL OF THE MATHEMATICAL SOCIETY OF JAPAN, 1979, 31 (02) : 273 - 279
[27] Spatially-Coupled Low Density Lattices based on Construction A with Applications to Compute-and-Forward
Tunali, Nihat Engin
Narayanan, Krishna R.
Pfister, Henry D.
2013 IEEE INFORMATION THEORY WORKSHOP (ITW), 2013,
[28] A polynomial time algorithm for a variant of shortest vector problem with applications in compute-and-forward design
Chao Tong
Jun Li
Jinming Wen
Cluster Computing, 2019, 22 : 10415 - 10424
[29] A polynomial time algorithm for a variant of shortest vector problem with applications in compute-and-forward design
Tong, Chao
Li, Jun
Wen, Jinming
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 5): : 10415 - 10424
[30] Badly approximable numbers over imaginary quadratic fields
Hines, Robert
ACTA ARITHMETICA, 2019, 190 (02) : 101 - 125

← 1 2 3 4 5 →