.png){kind=icon}
返回
Grobner Bases for Lattices and an Algebraic Decoding Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2013.13.120317.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present Grobner bases for lattices given in a general form, including integer and non-integer lattices. Grobner bases for binary linear codes were introduced by Borges-Quintana et al. [4]. We extend their work to non-binary group block codes. Then, given a lattice Lambda and its associated label code L, which is a group code, we define an ideal for L. A Grobner basis is assigned to Lambda as the Grobner basis of its label code L. Since the associated label code for integer and non-integer lattices are group codes, the assigned Grobner bases can be obtained for both cases. Using this Grobner basis an algebraic decoding algorithm is introduced. We provide an example of the decoding method for a lower dimension lattice. We explain that the complexity of this decoding method depends on the division algorithm and show this decoding method has polynomial time complexity. Experiments for some versions of root lattices (E-7 and E-8) show that for low SNR the performance of these lattices is near to the lower bounds given in [16].
Keyword:
Grobner bases
division algorithm
lattices
label code
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
Finite Element Aortic Injury Reconstruction of Near Side Lateral Impacts Using Real World Crash Data
PREAI
分享收藏Economics of One Health: Costs and benefits of integrated West Nile virus surveillance in Emilia-Romagna.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
分享收藏
查看更多内容