On the roots and minimum rank distance of skew cyclic codes
type: Item
instance of: scholarly article
title: On the roots and minimum rank distance of skew cyclic codes
zbMATH Open document ID: 1361.94065
author: Umberto Martínez-Peñas
published in: Designs, Codes and Cryptography
publication date: 2017-04-12T00:00:00Z
full work available at URL: https://arxiv.org/abs/1511.09329
Mathematics Subject Classification ID: 94B25
Mathematics Subject Classification ID: 94B15
zbMATH DE Number: 6705221
zbMATH Keywords: cyclic codes
zbMATH Keywords: finite rings
zbMATH Keywords: Hamming distance
zbMATH Keywords: linearized polynomial rings
zbMATH Keywords: rank distance
zbMATH Keywords: skew cyclic codes
MaRDI profile type: Publication
OpenAlex ID: W3121772707
arXiv ID: 1511.09329
cites work: Coding with skew polynomial rings
cites work: Skew-cyclic codes
cites work: Skew codes of prescribed distance or rank
cites work: On subfield subcodes of modified Reed-Solomon codes (Corresp.)
cites work: Rank weight hierarchy of some classes of polynomial codes
cites work: A symmetric Roos bound for linear codes
cites work: Theory of codes with maximum rank distance
cites work: On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
cites work: Construction of skew cyclic codes over \(\mathbb F_q+v\mathbb F_q\)
cites work: Generalizations of the BCH bound
cites work: Fundamentals of Error-Correcting Codes
cites work: Q5744087
cites work: Q3216750
cites work: Theory of non-commutative polynomials
cites work: Q4336975
cites work: On Metrics for Error Correction in Network Coding
cites work: On the dimension of subfield subcodes
cites work: On the minimum distance of cyclic codes
DOI: 10.1007/S10623-016-0262-Z
description: scientific article