Roos bound for skew cyclic codes in Hamming and rank metric
arXiv:2002.02327 · doi:10.1016/j.ffa.2020.101772
Abstract
In this paper, a Roos like bound on the minimum distance for skew cyclic codes over a general field is provided. The result holds in the Hamming metric and in the rank metric. The proofs involve arithmetic properties of skew polynomials and an analysis of the rank of parity-check matrices. For the rank metric case, a way to arithmetically construct codes with a prescribed minimum rank distance, using the skew Roos bound, is also given. Moreover, some examples of MDS codes and MRD codes over finite fields are built, using the skew Roos bound.
arXiv comment15 pages
References in corpus (5)
- A Rank-Metric Approach to Error Control in Random Network Coding
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Universal Secure Network Coding via Rank-Metric Codes
- Hartmann--Tzeng bound and Skew Cyclic Codes of Designed Hamming Distance
- On the roots and minimum rank distance of skew cyclic codes