On the roots and minimum rank distance of skew cyclic codes
From MaRDI portal
Publication:521867
DOI10.1007/S10623-016-0262-ZzbMATH Open1361.94065arXiv1511.09329OpenAlexW3121772707MaRDI QIDQ521867FDOQ521867
Authors: Umberto Martínez-Peñas 
Publication date: 12 April 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Abstract: Skew cyclic codes play the same role as cyclic codes in the theory of error-correcting codes for the rank metric. In this paper, we give descriptions of these codes by root spaces, cyclotomic spaces and idempotent generators. We prove that the lattice of skew cyclic codes is anti-isomorphic to the lattice of root spaces, study these two lattices and extend the rank-BCH bound on their minimum rank distance to rank-metric versions of the van Lint-Wilson's shift and Hartmann-Tzeng bounds. Finally, we study skew cyclic codes which are linear over the base field, proving that these codes include all Hamming-metric cyclic codes, giving then a new relation between these codes and rank-metric skew cyclic codes.
Full work available at URL: https://arxiv.org/abs/1511.09329
Recommendations
- Roos bound for skew cyclic codes in Hamming and rank metric
- Rank equivalent and rank degenerate skew cyclic codes
- Skew codes of prescribed distance or rank
- Sum-rank product codes and bounds on the minimum distance
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
Cites Work
- Title not available (Why is that?)
- Skew-cyclic codes
- Theory of non-commutative polynomials
- Fundamentals of Error-Correcting Codes
- Generalizations of the BCH bound
- Coding with skew polynomial rings
- Skew codes of prescribed distance or rank
- Theory of codes with maximum rank distance
- Title not available (Why is that?)
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- On Metrics for Error Correction in Network Coding
- On the minimum distance of cyclic codes
- Construction of skew cyclic codes over \(\mathbb F_q+v\mathbb F_q\)
- On the dimension of subfield subcodes
- Rank weight hierarchy of some classes of polynomial codes
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- Title not available (Why is that?)
- A symmetric Roos bound for linear codes
Cited In (6)
- Sum-rank product codes and bounds on the minimum distance
- Rank error-correcting pairs
- Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
- Rank equivalent and rank degenerate skew cyclic codes
- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
- Roos bound for skew cyclic codes in Hamming and rank metric
This page was built for publication: On the roots and minimum rank distance of skew cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521867)
