Skip to main navigation Skip to search Skip to main content

Interleaving of Polymorphic Gabidulin Codes: Dedicated to the memory of Ernst M. Gabidulin (1937-2021)

  • ThunderSoft Europe GmbH

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We define and analyze a new broad class of L-interleaved generalized Gabidulin codes over a cyclic Galois extension of a finite or an infinite field. Component codes can have different lengths, dimensions, supports, and field automorphisms, therefore, they are called polymorphic. Given a list Θ = (θ1,..., θL) of the field automorphisms, we define the Θ-distance, that coincides with the rank distance if θi = const. We show which codes in this class reach the Singleton bound. For the proposed codes we give an efficient unique syndrome decoding algorithm based on the skew transform, which corrects errors of Θ-weight beyond half the code Θ-distance.

Original languageEnglish
Title of host publication2023 18th International Symposium on Problems of Redundancy in Information and Control Systems, REDUNDANCY 2023
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages110-115
Number of pages6
ISBN (Electronic)9798350381528
DOIs
StatePublished - 2023
Event18th International Symposium on Problems of Redundancy in Information and Control Systems, REDUNDANCY 2023 - Moscow, Russian Federation
Duration: 24 Oct 202327 Oct 2023

Publication series

Name2023 18th International Symposium on Problems of Redundancy in Information and Control Systems, REDUNDANCY 2023

Conference

Conference18th International Symposium on Problems of Redundancy in Information and Control Systems, REDUNDANCY 2023
Country/TerritoryRussian Federation
CityMoscow
Period24/10/2327/10/23

Fingerprint

Dive into the research topics of 'Interleaving of Polymorphic Gabidulin Codes: Dedicated to the memory of Ernst M. Gabidulin (1937-2021)'. Together they form a unique fingerprint.

Cite this