TU Darmstadt / ULB / TUbiblio

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

Bulygin, Stanislav and Pellikaan, Ruud
Sala, M. and Mora, T. and Perret, L. and Sakata, S. and Traverso, C. (eds.) (2009):
Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases.
In: Gröbner Bases, Coding, and Cryptography, Springer, pp. 361-365, [Book Section]

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.

Item Type: Book Section
Erschienen: 2009
Editors: Sala, M. and Mora, T. and Perret, L. and Sakata, S. and Traverso, C.
Creators: Bulygin, Stanislav and Pellikaan, Ruud
Title: Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases
Language: ["languages_typename_1" not defined]
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.

Title of Book: Gröbner Bases, Coding, and Cryptography
Publisher: Springer
ISBN: 978-3-540-93805-7
Uncontrolled Keywords: Secure Data
Divisions: LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
LOEWE > LOEWE-Zentren
LOEWE
Date Deposited: 30 Dec 2016 20:23
Identification Number: TUD-CS-2009-0135
Export:
Suche nach Titel in: TUfind oder in Google

Optionen (nur für Redakteure)

View Item View Item