On deep-holes of Gabidulin codes
Information Theory
2018-09-11 v3 math.IT
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.
Cite
@article{arxiv.1711.11202,
title = {On deep-holes of Gabidulin codes},
author = {Weijun Fang and Li-Ping Wang and Daqing Wan},
journal= {arXiv preprint arXiv:1711.11202},
year = {2018}
}
Comments
Published in Finite Fields and Their Applications