Gröbner bases for lattices and an algebraic decoding algorithm

Malihe Aliasgari, Mohammad Reza Sadeghi, Daniel Panario

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

In this paper we present Gröbner bases for lattices. Gröbner bases for binary linear codes were introduced by Borges et al. [3]. We extend their work to non-binary group block codes. Given a lattice Λ and its associated label code L, which is a group code, we define an ideal for L. A Gröbner basis is assigned to Λ as the Gröbner basis of its label code L. Using this Gröbner basis an algebraic decoding algorithm is introduced.

Original languageEnglish
Title of host publication2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Pages1414-1415
Number of pages2
DOIs
StatePublished - 2011
Event2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 - Monticello, IL, United States
Duration: 28 Sep 201130 Sep 2011

Publication series

Name2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

Conference

Conference2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Country/TerritoryUnited States
CityMonticello, IL
Period28/09/1130/09/11

Keywords

  • Gröbner bases
  • lattices
  • reduction

Fingerprint

Dive into the research topics of 'Gröbner bases for lattices and an algebraic decoding algorithm'. Together they form a unique fingerprint.

Cite this