On deep holes of Gabidulin codes

DOI10.1016/J.FFA.2018.08.008zbMATH Open1401.94207arXiv1711.11202OpenAlexW2963190791WikidataQ129354903 ScholiaQ129354903MaRDI QIDQ1800701FDOQ1800701

Authors: Weijun Fang, L.-P. Wang, Daqing Wan 

Publication date: 24 October 2018

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: In this paper, we determine the covering radius and a class of deep holes for Gabidulin codes with both rank metric and Hamming metric. Moreover, we give a necessary and sufficient condition for deciding whether a word is not a deep hole for Gabidulin codes, by which we study the error distance of a special class of words to certain Gabidulin codes.

Full work available at URL: https://arxiv.org/abs/1711.11202

Recommendations

• On deep holes of generalized Reed-Solomon codes
• Deep holes of generalized Reed-Solomon codes
• On deep holes of standard Reed-Solomon codes
• On Determining Deep Holes of Generalized Reed–Solomon Codes
• On Determining Deep Holes of Generalized Reed-Solomon Codes
• Deep Holes of Projective Reed-Solomon Codes
• On deep holes of primitive projective Reed-Solomon codes
• Some results on deep holes of generalized projective Reed-Solomon codes
• On Deciding Deep Holes of Reed-Solomon Codes
• Deep holes in Reed-Solomon codes based on Dickson polynomials

zbMATH Keywords

covering radiusGabidulin codesdeep holesrank metric

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35) Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cites Work

• Bilinear forms over a finite field, with applications to coding theory
• Theory of codes with maximum rank distance
• On deep holes of standard Reed-Solomon codes
• On Reed-Solomon codes
• Deep holes in Reed-Solomon codes based on Dickson polynomials
• On Determining Deep Holes of Generalized Reed–Solomon Codes
• Coding for Errors and Erasures in Random Network Coding
• A Rank-Metric Approach to Error Control in Random Network Coding
• Deep holes of generalized Reed-Solomon codes
• On Deciding Deep Holes of Reed-Solomon Codes
• Further results on the covering radius of codes
• Packing and Covering Properties of Rank Metric Codes
• Covering radius---Survey and recent results
• On error distance of Reed-Solomon codes
• Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
• On the List and Bounded Distance Decodability of Reed–Solomon Codes
• On the covering radius of binary codes (Corresp.)
• On the covering radius of codes
• Asymptotic behaviour of codes in rank metric over finite fields
• On the Covering Radius of MDS Codes
• Title not available (Why is that?)

Cited In (1)

• Properties of subspace subcodes of Gabidulin codes

This page was built for publication: On deep holes of Gabidulin codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1800701)