Decoding Gabidulin Codes via Partial Inverses of Linearized Polynomials

Jiun-Hung Yu; Hans Andrea Loeliger

doi:10.1109/ISIT.2019.8849588

Decoding Gabidulin Codes via Partial Inverses of Linearized Polynomials

Jiun-Hung Yu, Hans Andrea Loeliger

Institute of Communications Engineering

Research output: Contribution to conference › Paper › peer-review

Abstract

We study Gabidulin codes from a partial-inverse perspective and obtain a key equation with a new converse, as well as a new interpolation formula. The resulting new algorithm is efficient and conceptually simple.

Original language	American English
Pages	2059-2063
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2019.8849588
State	Published - 7 Jul 2019
Event	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France Duration: 7 Jul 2019 → 12 Jul 2019

Conference

Conference	2019 IEEE International Symposium on Information Theory, ISIT 2019
Country/Territory	France
City	Paris
Period	7/07/19 → 12/07/19

Keywords

Decoding
Interpolation
Reed-Solomon codes
Transforms
Inverse problems
Complexity theory
Network coding

Access to Document

10.1109/ISIT.2019.8849588

Cite this

@conference{255934d52df243c98bcef9c786d022f3,

title = "Decoding Gabidulin Codes via Partial Inverses of Linearized Polynomials",

abstract = "We study Gabidulin codes from a partial-inverse perspective and obtain a key equation with a new converse, as well as a new interpolation formula. The resulting new algorithm is efficient and conceptually simple.",

keywords = "Decoding, Interpolation, Reed-Solomon codes, Transforms, Inverse problems, Complexity theory, Network coding",

author = "Jiun-Hung Yu and Loeliger, {Hans Andrea}",

year = "2019",

month = jul,

day = "7",

doi = "10.1109/ISIT.2019.8849588",

language = "American English",

pages = "2059--2063",

note = "2019 IEEE International Symposium on Information Theory, ISIT 2019 ; Conference date: 07-07-2019 Through 12-07-2019",

}

TY - CONF

T1 - Decoding Gabidulin Codes via Partial Inverses of Linearized Polynomials

AU - Yu, Jiun-Hung

AU - Loeliger, Hans Andrea

PY - 2019/7/7

Y1 - 2019/7/7

N2 - We study Gabidulin codes from a partial-inverse perspective and obtain a key equation with a new converse, as well as a new interpolation formula. The resulting new algorithm is efficient and conceptually simple.

AB - We study Gabidulin codes from a partial-inverse perspective and obtain a key equation with a new converse, as well as a new interpolation formula. The resulting new algorithm is efficient and conceptually simple.

KW - Decoding

KW - Interpolation

KW - Reed-Solomon codes

KW - Transforms

KW - Inverse problems

KW - Complexity theory

KW - Network coding

UR - http://www.scopus.com/inward/record.url?scp=85073157610&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2019.8849588

DO - 10.1109/ISIT.2019.8849588

M3 - Paper

AN - SCOPUS:85073157610

SP - 2059

EP - 2063

T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019

Y2 - 7 July 2019 through 12 July 2019

ER -

Decoding Gabidulin Codes via Partial Inverses of Linearized Polynomials

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this