An Application of Möller’s Algorithm to Coding Theory

M. Borges-Quintana (), M. A. Borges-Trenard () and E. Martínez-Moro ()
Additional contact information
M. Borges-Quintana: U. de Oriente, Dpto. de Matemática, FCMC
M. A. Borges-Trenard: U. de Oriente, Dpto. de Matemática, FCMC
E. Martínez-Moro: U. de Valladolid, Dpto. de Matemática Aplicada

A chapter in Gröbner Bases, Coding, and Cryptography, 2009, pp 379-384 from Springer

Abstract: Abstract We show the use of Möller’s Algorithm and related techniques for decoding and studying some combinatorial properties of linear codes. It is a concise summary of our previous results, with emphasis in illustrating the applications and comparing the developed method for computing the Gröbner basis associated with the code with the classical way to solve the same problem.

Keywords: Canonical Form; Binary Code; Linear Code; Combinatorial Property; Code Theory (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-93806-4_24

Ordering information: This item can be ordered from
http://www.springer.com/9783540938064

DOI: 10.1007/978-3-540-93806-4_24

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().