An application of Möller's algorithm to coding theory

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Borges-Quintana, M., Borges-Trenard, M. A., & Martínez-Moro, E. (2009). An application of Möller’s algorithm to coding theory. In Gröbner Bases, Coding, and Cryptography (pp. 379–384). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-93806-4_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free