Generic Decoding in the Sum-Rank Metric

Sven Puchinger, Julian Renner, Johan Rosenkilde

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

22 Downloads (Pure)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of 2020 IEEE International Symposium on Information Theory
PublisherIEEE
Publication dateJun 2020
Pages54-59
Article number9174497
ISBN (Electronic)9781728164328
DOIs
Publication statusPublished - Jun 2020
Event2020 IEEE International Symposium on Information Theory - Los Angeles, United States
Duration: 21 Jul 202026 Jul 2020

Conference

Conference2020 IEEE International Symposium on Information Theory
CountryUnited States
CityLos Angeles
Period21/07/202026/07/2020
SeriesIEEE International Symposium on Information Theory - Proceedings
Volume2020-June
ISSN2157-8095

Keywords

  • Generic Decoding
  • Sum-Rank Metric

Fingerprint Dive into the research topics of 'Generic Decoding in the Sum-Rank Metric'. Together they form a unique fingerprint.

Cite this