Publication: Analysis and Decoding of Linear Lee-Metric Codes with Application to Code-Based Cryptography
Analysis and Decoding of Linear Lee-Metric Codes with Application to Code-Based Cryptography
Date
Date
Date
Citations
Bariffi, J. (2024). Analysis and Decoding of Linear Lee-Metric Codes with Application to Code-Based Cryptography. (Dissertation, University of Zurich) https://doi.org/10.5167/uzh-259605
Abstract
Abstract
Abstract
Lee-metric codes are defined over integer residue rings endowed with the Lee metric. Even though the metric is one of the oldest metric considered in coding-theroy and has interesting applications in, for instance, DNA storage and code-based cryptography, it received relatively few attentions compared to other distances like the Hamming metric or the rank metric. Hence, codes in the Lee metric are still less studied than codes in other metrics. Recently, the interest in the Lee metric increased due to its similarities with the Euclide
Additional indexing
Creators (Authors)
Faculty
Faculty
Faculty
Item Type
Item Type
Item Type
Referees
Language
Language
Language
Place of Publication
Place of Publication
Place of Publication
Publication date
Publication date
Publication date
Date available
Date available
Date available
Number of pages
Number of pages
Number of pages
OA Status
OA Status
OA Status
Citations
Bariffi, J. (2024). Analysis and Decoding of Linear Lee-Metric Codes with Application to Code-Based Cryptography. (Dissertation, University of Zurich) https://doi.org/10.5167/uzh-259605