Roos bound for skew cyclic codes in Hamming and rank metric

dc.contributor.author	Alfarano, Gianira
dc.contributor.author	Lobillo Borrero, Francisco Javier
dc.contributor.author	Neri, Alessandro
dc.date.accessioned	2025-01-15T11:43:50Z
dc.date.available	2025-01-15T11:43:50Z
dc.date.issued	2021-01
dc.identifier.uri	https://hdl.handle.net/10481/99242
dc.description.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.	es_ES
dc.language.iso	eng	es_ES
dc.rights	Atribución 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by/4.0/	*
dc.subject	Cyclic codes	es_ES
dc.subject	Skew cyclic codes	es_ES
dc.subject	Roos bound	es_ES
dc.subject	Rank-metric codes	es_ES
dc.subject	MRD codes	es_ES
dc.title	Roos bound for skew cyclic codes in Hamming and rank metric	es_ES
dc.type	journal article	es_ES
dc.rights.accessRights	open access	es_ES
dc.identifier.doi	10.1016/j.ffa.2020.101772

Except where otherwise noted, this item's license is described as Atribución 4.0 Internacional