Generic Decoding in the Sum-Rank Metric
From MaRDI portal
Publication:5096972
DOI10.1109/TIT.2022.3167629zbMath1505.94117arXiv2001.04812MaRDI QIDQ5096972
Johan Rosenkilde, Julian Renner, Sven Puchinger
Publication date: 19 August 2022
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.04812
Related Items (7)
Duals of linearized Reed-Solomon codes ⋮ On the hardness of the Lee syndrome decoding problem ⋮ S-semantics -- an example ⋮ 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 ⋮ Distinguishing and recovering generalized linearized Reed-Solomon codes ⋮ On decoding high-order interleaved sum-rank-metric codes
This page was built for publication: Generic Decoding in the Sum-Rank Metric
