Generic Decoding in the Sum-Rank Metric

We propose the first non-trivial generic decoding algorithm for codes in the sum-rank metric. The new method combines ideas of well-known generic decoders in the Hamming and rank metric. For the same code parameters and number of errors, the new generic decoder has a larger expected complexity than...

Full description

Saved in:
Bibliographic Details
Published inProceedings / IEEE International Symposium on Information Theory pp. 54 - 59
Main Authors Puchinger, Sven, Renner, Julian, Rosenkilde, Johan
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2020
Subjects
Codes
Complexity theory
Decoding
Generic Decoding
Measurement
Sum-Rank Metric
Online AccessGet full text
ISSN2157-8117
DOI10.1109/ISIT44484.2020.9174497

Cover

More Information
Summary:We propose the first non-trivial generic decoding algorithm for codes in the sum-rank metric. The new method combines ideas of well-known generic decoders in the Hamming and rank metric. For the same code parameters and number of errors, the new generic decoder has a larger expected complexity than the known generic decoders for the Hamming metric and smaller than the known rank-metric decoders.
ISSN:2157-8117
DOI:10.1109/ISIT44484.2020.9174497