TU Darmstadt / ULB / TUbiblio

Bounded distance decoding of linear error-correcting codes with Gröbner bases

Bulygin, Stanislav ; Pellikaan, Ruud :
Bounded distance decoding of linear error-correcting codes with Gröbner bases.
In: Journal of Symbolic Computation, Special Issue "Gröbner Ba (Issue 12) S. 1626-1643.
[Artikel] , (2009)

Kurzbeschreibung (Abstract)

The problem of bounded distance decoding of arbitrary linear codes using Gröbner bases is addressed. A new method is proposed, which is based on reducing an initial decoding problem to solving a certain system of polynomial equations over a finite field. The peculiarity of this system is that, when we want to decode up to half the minimum distance, it has a unique solution even over the algebraic closure of the considered finite field, although field equations are not added. The equations in the system have degree at most 2. As our experiments suggest, our method is much faster than the one of Fitzgerald–Lax. It is also shown via experiments that the proposed approach in some range of parameters is superior to the generic syndrome decoding.

Typ des Eintrags: Artikel
Erschienen: 2009
Autor(en): Bulygin, Stanislav ; Pellikaan, Ruud
Titel: Bounded distance decoding of linear error-correcting codes with Gröbner bases
Sprache: ["languages_typename_1" not defined]
Kurzbeschreibung (Abstract):

The problem of bounded distance decoding of arbitrary linear codes using Gröbner bases is addressed. A new method is proposed, which is based on reducing an initial decoding problem to solving a certain system of polynomial equations over a finite field. The peculiarity of this system is that, when we want to decode up to half the minimum distance, it has a unique solution even over the algebraic closure of the considered finite field, although field equations are not added. The equations in the system have degree at most 2. As our experiments suggest, our method is much faster than the one of Fitzgerald–Lax. It is also shown via experiments that the proposed approach in some range of parameters is superior to the generic syndrome decoding.

Titel der Zeitschrift, Zeitung oder Schriftenreihe: Journal of Symbolic Computation
Band: Special Issue "Gröbner Ba
(Heft-)Nummer: Issue 12
Freie Schlagworte: Secure Data;Decoding; Gröbner basis; Linear code; Minimum distance; Syndrome decoding; System of polynomial equations
Fachbereich(e)/-gebiet(e): LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
LOEWE > LOEWE-Zentren
LOEWE
Hinterlegungsdatum: 30 Dez 2016 20:23
DOI: 10.1016/j.jsc.2007.12.003
ID-Nummer: TUD-CS-2010-0001
Export:

Optionen (nur für Redakteure)

Eintrag anzeigen Eintrag anzeigen