3 research outputs found
On Decoding and Applications of Interleaved Goppa Codes
Goppa Codes are a well-known class of codes with, among others, applications
in code-based cryptography. In this paper, we present a collaborative decoding
algorithm for interleaved Goppa codes (IGC). Collaborative decoding increases
the decoding radius beyond half of the designed minimum distance. We consider
wild Goppa codes and show that we can collaboratively correct more errors for
binary Goppa codes than the Patterson decoder. We propose a modified version of
the McEliece cryptosystem using wild IGC based on a recently proposed system by
Elleuch et al., analyze attacks on the system and present some parameters with
the corresponding key sizes
Decoding High-Order Interleaved Rank-Metric Codes
This paper presents an algorithm for decoding homogeneous interleaved codes
of high interleaving order in the rank metric. The new decoder is an adaption
of the Hamming-metric decoder by Metzner and Kapturowski (1990) and guarantees
to correct all rank errors of weight up to whose rank over the large base
field of the code equals the number of errors, where is the minimum rank
distance of the underlying code. In contrast to previously-known decoding
algorithms, the new decoder works for any rank-metric code, not only Gabidulin
codes. It is purely based on linear-algebraic computations, and has an explicit
and easy-to-handle success condition. Furthermore, a lower bound on the
decoding success probability for random errors of a given weight is derived.
The relation of the new algorithm to existing interleaved decoders in the
special case of Gabidulin codes is given.Comment: 18 pages, 2 figures, submitted to IEEE Transactions on Information
Theor
Error Decoding of Locally Repairable and Partial MDS Codes
In this work it is shown that locally repairable codes (LRCs) can be
list-decoded efficiently beyond the Johnson radius for a large range of
parameters by utilizing the local error-correction capabilities. The
corresponding decoding radius is derived and the asymptotic behavior is
analyzed. A general list-decoding algorithm for LRCs that achieves this radius
is proposed along with an explicit realization for LRCs that are subcodes of
Reed--Solomon codes (such as, e.g., Tamo--Barg LRCs). Further, a probabilistic
algorithm of low complexity for unique decoding of LRCs is given and its
success probability is analyzed.
The second part of this work considers error decoding of LRCs and partial
maximum distance separable (PMDS) codes through interleaved decoding. For a
specific class of LRCs the success probability of interleaved decoding is
investigated. For PMDS codes, it is shown that there is a wide range of
parameters for which interleaved decoding can increase their decoding radius
beyond the minimum distance such that the probability of successful decoding
approaches when the code length goes to infinity