Roos bound for skew cyclic codes in Hamming and rank metric
From MaRDI portal
Publication:1995207
DOI10.1016/j.ffa.2020.101772OpenAlexW3094216382MaRDI QIDQ1995207
Alessandro Neri, Gianira N. Alfarano, F. J. Lobillo
Publication date: 19 February 2021
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.02327
Ordinary and skew polynomial rings and semigroup rings (16S36) Bounds on codes (94B65) Cyclic codes (94B15)
Related Items (2)
Sum-rank product codes and bounds on the minimum distance ⋮ Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the roots and minimum rank distance of skew cyclic codes
- Coding with skew polynomial rings
- Skew codes of prescribed distance or rank
- Skew-cyclic codes
- Theory of codes with maximum rank distance
- A general theory of Vandermonde matrices
- Vandermonde and Wronskian matrices over division rings
- A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound
- Bilinear forms over a finite field, with applications to coding theory
- The Magma algebra system. I: The user language
- Generalized Gabidulin codes over fields of any characteristic
- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
- Theory of non-commutative polynomials
- Cyclic distances of idempotent convolutional codes
- Random construction of partial MDS codes
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Linear codes using skew polynomials with automorphisms and derivations
- NONCOMMUTATIVE POLYNOMIAL MAPS
- A New Perspective of Cyclicity in Convolutional Codes
- The Critical Pairs of Subsets of a Group of Prime Order
- On a class of error correcting binary group codes
- Further results on error correcting binary group codes
- NONCOMMUTATIVE SYMMETRIC FUNCTIONS AND W-POLYNOMIALS
- A Rank-Metric Approach to Error Control in Random Network Coding
- Codes as Modules over Skew Polynomial Rings
- A new lower bound for the minimum distance of a cyclic code
- Tensor codes for the rank metric
- A Sugiyama-Like Decoding Algorithm for Convolutional Codes
- Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
- On the minimum distance of cyclic codes
- Computing Free Distances of Idempotent Convolutional Codes
- Peterson–Gorenstein–Zierler algorithm for skew RS codes
- Universal Secure Network Coding via Rank-Metric Codes
- Convolutional codes I: Algebraic structure
- Generalizations of the BCH bound
- Finite-Dimensional Division Algebras over Fields
- Maximum distance<tex>q</tex>-nary codes
- Maximum-rank array codes and their application to crisscross error correction
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
This page was built for publication: Roos bound for skew cyclic codes in Hamming and rank metric
