Grobner Bases for Lattices and an Algebraic Decoding Algorithm

In this paper we present Grobner bases for lattices given in a general form, including integer and non-integer lattices. Grdot{o}bner bases for binary linear codes were introduced by Borges-Quintana et al. . We extend their work to non-binary group block codes. Then, given a lattice Λ and its associ...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on communications Ročník 61; číslo 4; s. 1222 - 1230
Hlavní autoři:	Aliasgari, M., Sadeghi, M., Panario, D.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.04.2013 Institute of Electrical and Electronics Engineers
Témata:	Applied sciences Coding, codes division algorithm Exact sciences and technology Generators Grobner bases Information, signal and communications theory label code Lattices Maximum likelihood decoding Polynomials Signal and communications theory Telecommunications and information theory Vectors Zinc Performance evaluation Gröbner bases Lower bound Block code Gröbner basis Trellis code Decoding Division algorithm Binary code Polynomial time Linear code label code Integer lattice lattices Time complexity Signal to noise ratio
ISSN:	0090-6778
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!