Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Jerkovits, Thomas"'
The sum-rank metric generalizes the Hamming and rank metric by partitioning vectors into blocks and defining the total weight as the sum of the rank weights of these blocks, based on their matrix representation. In this work, we explore support-guess
Externí odkaz:
http://arxiv.org/abs/2410.15806
In this paper we consider a Metzner-Kapturowski-like decoding algorithm for high-order interleaved sum-rank-metric codes, offering a novel perspective on the decoding process through the concept of an error code. The error code, defined as the linear
Externí odkaz:
http://arxiv.org/abs/2409.18488
This paper provides new bounds on the size of spheres in any coordinate-additive metric with a particular focus on improving existing bounds in the sum-rank metric. We derive improved upper and lower bounds based on the entropy of a distribution rela
Externí odkaz:
http://arxiv.org/abs/2404.10666
In this paper we address the problem of decoding linearized Reed-Solomon (LRS) codes beyond their unique decoding radius. We analyze the complexity in order to evaluate if the considered problem is of cryptographic relevance, i.e., can be used to des
Externí odkaz:
http://arxiv.org/abs/2306.04359
Publikováno v:
Code-Based Cryptography 10 (2022) 90-109
We consider decoding of vertically homogeneous interleaved sum-rank-metric codes with high interleaving order $s$, that are constructed by stacking $s$ codewords of a single constituent code. We propose a Metzner--Kapturowski-like decoding algorithm
Externí odkaz:
http://arxiv.org/abs/2303.17454
Skew polynomials are a class of non-commutative polynomials that have several applications in computer science, coding theory and cryptography. In particular, skew polynomials can be used to construct and decode evaluation codes in several metrics, l
Externí odkaz:
http://arxiv.org/abs/2207.01319
Autor:
Bartz, Hannes, Jerkovits, Thomas
Skew polynomials are a class of non-commutative polynomials that have several applications in computer science, coding theory and cryptography. In particular, skew polynomials can be used to construct and decode evaluation codes in several metrics, l
Externí odkaz:
http://arxiv.org/abs/2202.09057
Autor:
Maringer, Georg, Xhemrishi, Marvin, Puchinger, Sven, Garb, Kathrin, Liu, Hedongliang, Jerkovits, Thomas, Kürzinger, Ludwig, Hiller, Matthias, Wachter-Zeh, Antonia
Cryptographic algorithms rely on the secrecy of their corresponding keys. On embedded systems with standard CMOS chips, where secure permanent memory such as flash is not available as a key storage, the secret key can be derived from Physical Unclona
Externí odkaz:
http://arxiv.org/abs/2112.02198
This paper investigates the decoding of certain Gabidulin codes that were transmitted over a channel with space-symmetric errors. Space-symmetric errors are additive error matrices that have the property that their column and row spaces are equal. We
Externí odkaz:
http://arxiv.org/abs/2102.02554
We speed up existing decoding algorithms for three code classes in different metrics: interleaved Gabidulin codes in the rank metric, lifted interleaved Gabidulin codes in the subspace metric, and linearized Reed-Solomon codes in the sum-rank metric.
Externí odkaz:
http://arxiv.org/abs/2005.09916