On deep holes of Gabidulin codes

DOI10.1016/j.ffa.2018.08.008zbMath1401.94207arXiv1711.11202OpenAlexW2963190791WikidataQ129354903 ScholiaQ129354903MaRDI QIDQ1800701

Daqing Wan, Li-Ping Wang, Weijun Fang

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) Other types of codes (94B60) Decoding (94B35) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cites Work

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

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