Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric

DOI10.1109/TIT.2021.3067318zbMath1486.94180arXiv2005.09916OpenAlexW3135980946MaRDI QIDQ4958205

Johan Rosenkilde, Sven Puchinger, Hannes Bartz, Thomas Jerkovits

Publication date: 7 September 2021

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.09916

zbMATH Keywords

decoding algorithmsinterleaved Gabidulin codes in rank metriclifted interleaved Gabidulin codes in subspace metriclinearized Reed-Solomon codes in sum-rank metric

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (5)

Skew differential Goppa codes and their application to McEliece cryptosystem ⋮ Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory ⋮ Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes ⋮ Rank-Metric Codes and Their Applications ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications

This page was built for publication: Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric