On the roots and minimum rank distance of skew cyclic codes
From MaRDI portal
(Redirected from Publication:521867)
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.
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
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 1009715 (Why is no real title available?)
- scientific article; zbMATH DE number 6541785 (Why is no real title available?)
- A symmetric Roos bound for linear codes
- Coding with skew polynomial rings
- Construction of skew cyclic codes over \(\mathbb F_q+v\mathbb F_q\)
- Fundamentals of Error-Correcting Codes
- Generalizations of the BCH bound
- On Metrics for Error Correction in Network Coding
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- On the dimension of subfield subcodes
- On the minimum distance of cyclic codes
- Rank weight hierarchy of some classes of polynomial codes
- Skew codes of prescribed distance or rank
- Skew-cyclic codes
- Theory of codes with maximum rank distance
- Theory of non-commutative polynomials
Cited in
(6)- Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
- Roos bound for skew cyclic codes in Hamming and rank metric
- Rank error-correcting pairs
- Rank equivalent and rank degenerate skew cyclic codes
- Sum-rank product codes and bounds on the minimum distance
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)
