On the roots and minimum rank distance of skew cyclic codes
From MaRDI portal
Publication:521867
DOI10.1007/s10623-016-0262-zzbMath1361.94065arXiv1511.09329OpenAlexW3121772707MaRDI QIDQ521867
Publication date: 12 April 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.09329
Related Items (5)
Rank error-correcting pairs ⋮ 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 ⋮ Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of skew cyclic codes over \(\mathbb F_q+v\mathbb F_q\)
- Coding with skew polynomial rings
- A symmetric Roos bound for linear codes
- Skew codes of prescribed distance or rank
- Skew-cyclic codes
- Theory of codes with maximum rank distance
- Theory of non-commutative polynomials
- Rank weight hierarchy of some classes of polynomial codes
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- On the dimension of subfield subcodes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Fundamentals of Error-Correcting Codes
- On the minimum distance of cyclic codes
- On Metrics for Error Correction in Network Coding
- Generalizations of the BCH bound
This page was built for publication: On the roots and minimum rank distance of skew cyclic codes
