dc.contributor.author | Kadir, Wrya Karim Kadir | |
dc.contributor.author | Li, Chunlei | |
dc.contributor.author | Zullo, Ferdinando | |
dc.date.accessioned | 2022-03-22T12:52:16Z | |
dc.date.available | 2022-03-22T12:52:16Z | |
dc.date.created | 2022-01-06T15:55:18Z | |
dc.date.issued | 2021 | |
dc.identifier.issn | 2157-8095 | |
dc.identifier.uri | https://hdl.handle.net/11250/2986838 | |
dc.description.abstract | In this paper we present an interpolation-based decoding algorithm to decode a family of maximum rank distance codes proposed recently by Trombetti and Zhou. We employ the properties of the Dickson matrix associated with a linearized polynomial with a given rank and the modified Berlekamp-Massey algorithm in decoding. When the rank of the error vector attains the unique decoding radius, the problem is converted to solving a quadratic polynomial, which ensures that the proposed decoding algorithm has polynomial-time complexity. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | IEEE | en_US |
dc.title | On interpolation-based decoding of a class of maximum rank distance codes | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | acceptedVersion | en_US |
dc.rights.holder | Copyright 2021 IEEE | en_US |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.qualitycode | 1 | |
dc.identifier.doi | 10.1109/ISIT45174.2021.9517980 | |
dc.identifier.cristin | 1976119 | |
dc.source.journal | IEEE International Symposium on Information Theory. Proceedings. 2021 | en_US |
dc.identifier.citation | IEEE International Symposium on Information Theory. Proceedings | en_US |