Fast decoding of Gabidulin codes
type: Item
instance of: scholarly article
title: Fast decoding of Gabidulin codes
zbMATH Open document ID: 1259.94082
author: Antonia Wachter-Zeh
author: Valentin Afanassiev
author: V. R. Sidorenko
published in: Designs, Codes and Cryptography
publication date: 2013-01-28T00:00:00Z
full work available at URL: 13.pdf
Mathematics Subject Classification ID: 94B35
zbMATH DE Number: 6131783
zbMATH Keywords: Gabidulin codes
zbMATH Keywords: rank metric
zbMATH Keywords: linearized polynomials
zbMATH Keywords: fast decoding
zbMATH Keywords: fast symbolic product
zbMATH Keywords: fast symbolic division
MaRDI profile type: Publication
OpenAlex ID: W2049833502
cites work: Bilinear forms over a finite field, with applications to coding theory
cites work: Q4886141
cites work: Theory of codes with maximum rank distance
cites work: Coding for Errors and Erasures in Random Network Coding
cites work: Q4893202
cites work: Coding and Cryptography
cites work: Theory of non-commutative polynomials
cites work: Q4037491
cites work: Maximum-rank array codes and their application to crisscross error correction
cites work: Linearized Shift-Register Synthesis
cites work: A Rank-Metric Approach to Error Control in Random Network Coding
cites work: Probabilistic algorithm for finding roots of linearized polynomials
cites work: A method for solving key equation for decoding goppa codes
DOI: 10.1007/S10623-012-9659-5
description: scientific article; zbMATH DE number 6131783