Twisted linearized Reed-Solomon codes: a skew polynomial framework
From MaRDI portal
Publication:2168840
DOI10.1016/j.jalgebra.2022.06.027OpenAlexW3164436005MaRDI QIDQ2168840
Publication date: 26 August 2022
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.10451
MDS codesskew polynomialssum-rank metricmaximum sum-rank distance codestwisted linearized Reed-Solomon codes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Ordinary and skew polynomial rings and semigroup rings (16S36)
Related Items (8)
A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices ⋮ Evasive subspaces, generalized rank weights and near MRD codes ⋮ New constructions of self-dual codes via twisted generalized Reed-Solomon codes ⋮ Constructions of optimal rank-metric codes from automorphisms of rational function fields ⋮ Distinguishing and recovering generalized linearized Reed-Solomon codes ⋮ Doubly and triply extended MSRD codes ⋮ Duality of generalized twisted Reed-Solomon codes and Hermitian self-dual MDS or NMDS codes ⋮ The geometry of one-weight codes in the sum-rank metric
Cites Work
- Unnamed Item
- Unnamed Item
- Rank-metric codes and their duality theory
- A new family of linear maximum rank distance codes
- MacWilliams extension theorems and the local-global property for codes over Frobenius rings
- On \(x^{q+1}+ax+b\)
- Hamming and simplex codes for the sum-rank metric
- Duality theory for space-time codes over finite fields
- Galois extensions and subspaces of alternating bilinear forms with special rank properties
- Theory of codes with maximum rank distance
- A general theory of Vandermonde matrices
- Vandermonde and Wronskian matrices over division rings
- \(t\)-sum generators of finite Abelian groups
- Bilinear forms over a finite field, with applications to coding theory
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- On the genericity of maximum rank distance and Gabidulin codes
- A characterization of linearized polynomials with maximum kernel
- Theory of non-commutative polynomials
- Solving \(X^{q+1}+X+a=0\) over finite fields
- Linear sets and MRD-codes arising from a class of scattered linearized polynomials
- Theory and applications of linearized multivariate skew polynomials
- Anticodes in the sum-rank metric
- Sum-rank product codes and bounds on the minimum distance
- Extending two families of maximum rank distance codes
- Equivalence and characterizations of linear rank-metric codes based on invariants
- An algorithm for decoding skew Reed-Solomon codes with respect to the skew metric
- Theory of supports for linear codes endowed with the sum-rank metric
- A characterization of the number of roots of linearized and projective polynomials in the field of coefficients
- Linear codes using skew polynomials with automorphisms and derivations
- Linearized polynomials over finite fields revisited
- Convolutional Codes With Maximum Column Sum Rank for Network Streaming
- Additive Rank Metric Codes
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- 13. MRD codes: constructions and connections
- Wedderburn polynomials over division rings, II
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- Nonbinary Stabilizer Codes Over Finite Fields
- A Rank-Metric Approach to Error Control in Random Network Coding
- Projective polynomials
- A New Family of MRD Codes in <inline-formula> <tex-math notation="LaTeX">$\mathbb{F_q}^{2n\times2n}$ </tex-math> </inline-formula> With Right and Middle Nuclei <inline-formula> <tex-math notation="LaTeX">$\mathbb F_{q^n}$ </tex-math> </inline-formula>
- On the design of algebraic space-time codes for MIMO block-fading channels
- Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes
- Fundamental Properties of Sum-Rank-Metric Codes
- Twisted Reed–Solomon Codes
- New semifields and new MRD codes from skew polynomial rings
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
- Abelian extensions of commutative rings
- 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: Twisted linearized Reed-Solomon codes: a skew polynomial framework
