Rank equivalent and rank degenerate skew cyclic codes

DOI10.3934/AMC.2017018MaRDI QIDQ2397487zbMATH OpenOpenAlexFDO

Authors Umberto Martínez-Peñas

Publication date 22 May 2017

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1601.06993

zbMATH Keywords

cyclic codesfinite ringsskew cyclic codesrank distancelinearized polynomial ringsrank degeneraterank equivalence

Mathematics Subject Classification ID

Cyclic codes (94B15) Bounds on codes (94B65)

Abstract: Two skew cyclic codes can be equivalent for the Hamming metric only if they have the same length, and only the zero code is degenerate. The situation is completely different for the rank metric, where lengths of codes correspond to the number of outgoing links from the source when applying the code on a network. We study rank equivalences between skew cyclic codes of different lengths and, with the aim of finding the skew cyclic code of smallest length that is rank equivalent to a given one, we define different types of length for a given skew cyclic code, relate them and compute them in most cases. We give different characterizations of rank degenerate skew cyclic codes using conventional polynomials and linearized polynomials. Some known results on the rank weight hierarchy of cyclic codes for some lengths are obtained as particular cases and extended to all lengths and to all skew cyclic codes. Finally, we prove that the smallest length of a linear code that is rank equivalent to a given skew cyclic code can be attained by a pseudo-skew cyclic code. Throughout the paper, we find new relations between linear skew cyclic codes and their Galois closures.

Recommendations

• On the roots and minimum rank distance of skew cyclic codes
• Roos bound for skew cyclic codes in Hamming and rank metric
• Skew codes of prescribed distance or rank
• Skew cyclic and quasi-cyclic codes of arbitrary length over Galois rings
• On defining generalized rank weights

Cites work

• Coding with skew polynomial rings
• Fundamentals of Error-Correcting Codes
• Generalized rank weights: A duality statement
• On Cryptosystems Based on Polynomials and Finite Fields
• On Metrics for Error Correction in Network Coding
• On a Special Class of Polynomials
• On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
• On the dimension of subfield subcodes
• On the roots and minimum rank distance of skew cyclic codes
• Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
• Skew-cyclic codes
• Theory of codes with maximum rank distance
• Theory of non-commutative polynomials

Cited in

(1)

• On the roots and minimum rank distance of skew cyclic codes

This page was built for publication: Rank equivalent and rank degenerate skew cyclic codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397487)