Year: 2024
Type: dissertation
Abstract: This thesis investigates efficient decoding algorithms for sum-rank-metric codes, with a focus on decoding beyond the unique decoding radius. Techniques such as interleaving and randomized decoding algorithms are explored to enhance the decoding performance. The complexity analysis may also assist in defining the security level of future quantum-resistant code-based cryptosystems using the sum-rank metric, which are currently under development.
Source: elib (German Aerospace Center)
Authors: Jerkovits, Thomas, Wachter-Zeh, Antonia 1985-, Technische Universität München
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7010701445