Gröbner bases for lattices and an algebraic decoding algorithm

In this paper we present Grobner bases for lattices. Grobner 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 Grobner basis i...

Celý popis

Podrobná bibliografia

Vydané v:	2011 49th Annual Allerton Conference on Communication, Control, and Computing s. 1414 - 1415
Hlavní autori:	Aliasgari, Malihe, Sadeghi, Mohammad-Reza, Panario, Daniel
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.09.2011
Predmet:	Block codes Complexity theory Gröbner bases Lattices Maximum likelihood decoding Polynomials reduction Vectors
ISBN:	1457718170, 9781457718175
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!