2023
DOI: 10.1007/s10623-023-01214-8
|View full text |Cite
|
Sign up to set email alerts
|

Interpolation-based decoding of folded variants of linearized and skew Reed–Solomon codes

Abstract: The sum-rank metric is a hybrid between the Hamming metric and the rank metric and suitable for error correction in multishot network coding and distributed storage as well as for the design of quantum-resistant cryptosystems. In this work, we consider the construction and decoding of folded linearized Reed–Solomon (FLRS) codes, which are shown to be maximum sum-rank distance (MSRD) for appropriate parameter choices. We derive an efficient interpolation-based decoding algorithm for FLRS codes that can be used … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 54 publications
0
2
0
Order By: Relevance
“…Note, that the assumption that the coefficients q (r ) i, j are uniformly distributed over F q m does not reflect the distribution of the error space tuple E. Although there is evidence that this assumption is reasonable (see e.g. [16] for folded LRS codes), it does not reflect the actual error model of the multishot operator channel.…”
Section: Algorithm 2 List Decoding Of Lilrs Codesmentioning
confidence: 99%
“…Note, that the assumption that the coefficients q (r ) i, j are uniformly distributed over F q m does not reflect the distribution of the error space tuple E. Although there is evidence that this assumption is reasonable (see e.g. [16] for folded LRS codes), it does not reflect the actual error model of the multishot operator channel.…”
Section: Algorithm 2 List Decoding Of Lilrs Codesmentioning
confidence: 99%
“…Note, that the assumption that the coefficients q (r) i,j are uniformly distributed over F q m does not reflect the distribution of the error space tuple E. Although there is evidence that this assumption is reasonable (see e.g. [50] for folded LRS codes), it does not reflect the actual error model of the multishot operator channel. Similar as in [25,Lemma 8] for interleaved Gabidulin codes and [31,Theorem 4] for ILRS codes, the conditions of successful decoding of the interpolation-based decoder can be reduced to the conditions of the Loidreau-Overbeck-like decoder from Section 4.2.…”
Section: Probabilistic Unique Decodingmentioning
confidence: 99%