Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases

S. Bulygin, G.R. Pellikaan

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

3 Citations (Scopus)
1 Downloads (Pure)

Abstract

In this short note we show how one can decode linear error-correcting codes up to half the minimum distance via solving a system of polynomial equations over a finite field. We also explicitly present the reduced Gröbner basis for the system considered.
Original languageEnglish
Title of host publicationGröbner Bases, Coding, and Cryptography
EditorsM. Sala, T. Mora, L. Perret, S. Sakata, C. Traverso
Place of PublicationBerlin
PublisherSpringer
Pages361-365
ISBN (Print)978-3-540-93805-7
DOIs
Publication statusPublished - 2009

Publication series

NameTexts and Monographs in Symbolic Computation
ISSN (Print)0943-853X

Fingerprint

Dive into the research topics of 'Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases'. Together they form a unique fingerprint.

Cite this