Roos bound for skew cyclic codes in Hamming and rank metric
From MaRDI portal
Publication:1995207
Recommendations
Cites work
- A general theory of Vandermonde matrices
- A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound
- A new lower bound for the minimum distance of a cyclic code
- A New Perspective of Cyclicity in Convolutional Codes
- A Rank-Metric Approach to Error Control in Random Network Coding
- A Sugiyama-Like Decoding Algorithm for Convolutional Codes
- Bilinear forms over a finite field, with applications to coding theory
- Codes as modules over skew polynomial rings
- Coding with skew polynomial rings
- Computing free distances of idempotent convolutional codes
- Convolutional codes I: Algebraic structure
- Cyclic distances of idempotent convolutional codes
- Finite-Dimensional Division Algebras over Fields
- Further results on error correcting binary group codes
- Generalizations of the BCH bound
- Generalized Gabidulin codes over fields of any characteristic
- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 3147923 (Why is no real title available?)
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- scientific article; zbMATH DE number 1988897 (Why is no real title available?)
- scientific article; zbMATH DE number 3058859 (Why is no real title available?)
- Linear codes using skew polynomials with automorphisms and derivations
- Maximum distance<tex>q</tex>-nary codes
- Maximum-rank array codes and their application to crisscross error correction
- Noncommutative polynomial maps.
- NONCOMMUTATIVE SYMMETRIC FUNCTIONS AND W-POLYNOMIALS
- On a class of error correcting binary group codes
- On the minimum distance of cyclic codes
- On the roots and minimum rank distance of skew cyclic codes
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Peterson-Gorenstein-Zierler algorithm for skew RS codes
- Random construction of partial MDS codes
- Skew codes of prescribed distance or rank
- Skew-cyclic codes
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Tensor codes for the rank metric
- The Critical Pairs of Subsets of a Group of Prime Order
- The Magma algebra system. I: The user language
- Theory of codes with maximum rank distance
- Theory of non-commutative polynomials
- Universal Secure Network Coding via Rank-Metric Codes
- Vandermonde and Wronskian matrices over division rings
- Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
Cited in
(9)- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
- Sum-rank product codes and bounds on the minimum distance
- Rank equivalent and rank degenerate skew cyclic codes
- Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
- On the roots and minimum rank distance of skew cyclic codes
- Roos bound for skew cyclic codes in Hamming and rank metric
- Decoding up to Hartmann-Tzeng and Roos bounds for rank codes
- Linear complementary pairs of skew constacyclic codes
- A symmetric Roos bound for linear codes
This page was built for publication: Roos bound for skew cyclic codes in Hamming and rank metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1995207)
