On deep holes of Gabidulin codes

DOI10.1016/J.FFA.2018.08.008MaRDI QIDQ1800701zbMATH OpenOpenAlexWikidataFDO

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)

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

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)

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.

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

Cites work

• scientific article; zbMATH DE number 5710327 (Why is no real title available?)
• A Rank-Metric Approach to Error Control in Random Network Coding
• Asymptotic behaviour of codes in rank metric over finite fields
• Bilinear forms over a finite field, with applications to coding theory
• Coding for Errors and Erasures in Random Network Coding
• Covering radius---Survey and recent results
• Deep holes in Reed-Solomon codes based on Dickson polynomials
• Deep holes of generalized Reed-Solomon codes
• Further results on the covering radius of codes
• Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
• On Deciding Deep Holes of Reed-Solomon Codes
• On Determining Deep Holes of Generalized Reed–Solomon Codes
• On Reed-Solomon codes
• On deep holes of standard Reed-Solomon codes
• On error distance of Reed-Solomon codes
• On the Covering Radius of MDS Codes
• 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
• Packing and Covering Properties of Rank Metric Codes
• Theory of codes with maximum rank distance

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)