Generic Decoding in the Sum-Rank Metric
- 1 June 2020
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 54-59
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.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- MRD rank metric convolutional codes2017
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank CodesIEEE Transactions on Information Theory, 2016
- On the Complexity of the Rank Syndrome Decoding ProblemIEEE Transactions on Information Theory, 2015
- Convolutional Codes in Rank Metric With Application to Random Network CodingIEEE Transactions on Information Theory, 2015
- On (Partial) unit memory codes based on Gabidulin codesProblems of Information Transmission, 2011
- Coding for Errors and Erasures in Random Network CodingIEEE Transactions on Information Theory, 2008
- Ideals over a Non-Commutative Ring and their Application in Cryptology2001
- The cryptographic security of the syndrome decoding problem for rank distance codes1996
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- The use of information sets in decoding cyclic codesIEEE Transactions on Information Theory, 1962