Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:2109.02069 (cs)
[Submitted on 5 Sep 2021 (v1), last revised 11 Oct 2021 (this version, v2)]

Title:New Communication Models and Decoding of Maximum Rank Distance Codes

Authors:Wrya K. Kadir
View PDF
Abstract:In this paper an interpolation-based decoding algorithm to decode Gabidulin codes, transmitted through a finely restricted channel, is proposed. The algorithm is able to decode rank errors beyond half the minimum distance by one unit. Also the existing decoding algorithms for generalized twisted Gabidulin codes and additive generalized twisted Gabidulin codes are improved.
Comments: arXiv admin note: text overlap with arXiv:2105.03115
Subjects: Information Theory (cs.IT); Rings and Algebras (math.RA)
ACM classes: E.4; E.5; G.2
Cite as: arXiv:2109.02069 [cs.IT]
  (or arXiv:2109.02069v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2109.02069

Submission history

From: Wrya Karim Kadir [view email]
[v1] Sun, 5 Sep 2021 13:16:03 UTC (171 KB)
[v2] Mon, 11 Oct 2021 07:11:40 UTC (45 KB)
Full-text links:

Access Paper:

license icon view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2021-09
Change to browse by:
cs
math
math.IT
math.RA

References & Citations

DBLP - CS Bibliography

listing | bibtex
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)