Duals of linearized Reed-Solomon codes
From MaRDI portal
Publication:2678987
DOI10.1007/s10623-022-01102-7OpenAlexW3211022371WikidataQ114849659 ScholiaQ114849659MaRDI QIDQ2678987
Publication date: 18 January 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.12675
Ordinary and skew polynomial rings and semigroup rings (16S36) Other types of codes (94B60) Special polynomials in general fields (12E10)
Related Items (2)
Distinguishing and recovering generalized linearized Reed-Solomon codes ⋮ A theory of residues for skew rational functions
Cites Work
- Unnamed Item
- Unnamed Item
- Coding with skew polynomial rings
- Theory of codes with maximum rank distance
- A general theory of Vandermonde matrices
- 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
- Generalized Gabidulin codes over fields of any characteristic
- Skolem-Noether algebras
- Pseudo linear transformations and evaluation in Ore extensions
- A theory of residues for skew rational functions
- Theory of supports for linear codes endowed with the sum-rank metric
- Linear codes using skew polynomials with automorphisms and derivations
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- A Rank-Metric Approach to Error Control in Random Network Coding
- Fundamental Properties of Sum-Rank-Metric Codes
- Generic Decoding in the Sum-Rank Metric
- Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
- Centers of skew polynomial rings
- Finite-Dimensional Division Algebras over Fields
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: Duals of linearized Reed-Solomon codes
