Roos bound for skew cyclic codes in Hamming and rank metric
From MaRDI portal
Publication:1995207
DOI10.1016/J.FFA.2020.101772OpenAlexW3094216382MaRDI QIDQ1995207FDOQ1995207
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) Cyclic codes (94B15) Bounds on codes (94B65)
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Skew-cyclic codes
- Bilinear forms over a finite field, with applications to coding theory
- Theory of non-commutative polynomials
- Title not available (Why is that?)
- On a class of error correcting binary group codes
- Convolutional codes I: Algebraic structure
- Generalizations of the BCH bound
- Title not available (Why is that?)
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Coding with skew polynomial rings
- Skew codes of prescribed distance or rank
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Codes as Modules over Skew Polynomial Rings
- Title not available (Why is that?)
- Finite-Dimensional Division Algebras over Fields
- Theory of codes with maximum rank distance
- A Rank-Metric Approach to Error Control in Random Network Coding
- Maximum distance<tex>q</tex>-nary codes
- Maximum-rank array codes and their application to crisscross error correction
- Universal Secure Network Coding via Rank-Metric Codes
- On the minimum distance of cyclic codes
- Title not available (Why is that?)
- A general theory of Vandermonde matrices
- Vandermonde and Wronskian matrices over division rings
- The Critical Pairs of Subsets of a Group of Prime Order
- Linear codes using skew polynomials with automorphisms and derivations
- Noncommutative polynomial maps.
- NONCOMMUTATIVE SYMMETRIC FUNCTIONS AND W-POLYNOMIALS
- 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
- On the roots and minimum rank distance of skew cyclic codes
- Further results on error correcting binary group codes
- Random construction of partial MDS codes
- A New Perspective of Cyclicity in Convolutional Codes
- Generalized Gabidulin codes over fields of any characteristic
- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
- A Sugiyama-Like Decoding Algorithm for Convolutional Codes
- Peterson–Gorenstein–Zierler algorithm for skew RS codes
- Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
- Cyclic distances of idempotent convolutional codes
- Tensor codes for the rank metric
- Computing Free Distances of Idempotent Convolutional Codes
Cited In (4)
Uses Software
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)