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 language | English |
|---|---|
| Title of host publication | Proceedings of 2020 IEEE International Symposium on Information Theory |
| Publisher | IEEE |
| Publication date | Jun 2020 |
| Pages | 54-59 |
| Article number | 9174497 |
| ISBN (Electronic) | 9781728164328 |
| DOIs | |
| Publication status | Published - Jun 2020 |
| Event | 2020 IEEE International Symposium on Information Theory - Virtual event, Los Angeles, United States Duration: 21 Jun 2020 → 26 Jun 2020 https://2020.ieee-isit.org/ |
Conference
| Conference | 2020 IEEE International Symposium on Information Theory |
|---|---|
| Location | Virtual event |
| Country/Territory | United States |
| City | Los Angeles |
| Period | 21/06/2020 → 26/06/2020 |
| Internet address |
| Series | IEEE International Symposium on Information Theory - Proceedings |
|---|---|
| Volume | 2020-June |
| ISSN | 2157-8095 |
Keywords
- Generic Decoding
- Sum-Rank Metric