|
This article is cited in 1 scientific paper (total in 1 paper)
Coding Theory
On list decoding of certain $\mathbb{F}_q$-linear codes
N. A. Polyanskii Skolkovo Institute of Science and Technology (Skoltech), Moscow, Russia
Abstract:
We present a list decoding algorithm for $\mathbb{F}_q$-linear codes that generalize the Reed–Solomon $s$-codes.
Keywords:
list decoding, Reed–Solomon $s$-codes, minimum distance.
Received: 05.03.2021 Revised: 17.11.2021 Accepted: 23.11.2021
Citation:
N. A. Polyanskii, “On list decoding of certain $\mathbb{F}_q$-linear codes”, Probl. Peredachi Inf., 57:4 (2021), 45–62; Problems Inform. Transmission, 57:4 (2021), 341–356
Linking options:
https://www.mathnet.ru/eng/ppi2354 https://www.mathnet.ru/eng/ppi/v57/i4/p45
|
Statistics & downloads: |
Abstract page: | 87 | Full-text PDF : | 2 | References: | 18 | First page: | 13 |
|