Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
From MaRDI portal
Publication:1644851
DOI10.1016/j.jalgebra.2018.02.005zbMath1417.94122arXiv1710.03109OpenAlexW2963073980MaRDI QIDQ1644851
Publication date: 22 June 2018
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.03109
Reed-Solomon codesGabidulin codeslinearized polynomialsskew polynomialsHamming metricrank metricsum-rank metric
Ordinary and skew polynomial rings and semigroup rings (16S36) Other types of codes (94B60) Special polynomials in general fields (12E10)
Related Items
Sum-rank product codes and bounds on the minimum distance, Zeros with multiplicity, Hasse derivatives and linear factors of general skew polynomials, Twisted linearized Reed-Solomon codes: a skew polynomial framework, A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices, Duals of linearized Reed-Solomon codes, Systematic maximum sum rank codes, Classification of multivariate skew polynomial rings over finite fields via affine transformations of variables, Constructions of optimal rank-metric codes from automorphisms of rational function fields, Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory, Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes, Distinguishing and recovering generalized linearized Reed-Solomon codes, Doubly and triply extended MSRD codes, Some matroids related to sum-rank metric codes, On decoding high-order interleaved sum-rank-metric codes, An algorithm for decoding skew Reed-Solomon codes with respect to the skew metric, Evaluation and interpolation over multivariate skew polynomial rings, Codes from unit groups of division algebras over number fields, A theory of residues for skew rational functions, Theory and applications of linearized multivariate skew polynomials, Theory of supports for linear codes endowed with the sum-rank metric, Hamming and simplex codes for the sum-rank metric, General remainder theorem and factor theorem for polynomials over non-commutative coefficient rings, The geometry of one-weight codes in the sum-rank metric, Codes in the Sum-Rank Metric: Fundamentals and Applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On (partial) unit memory codes based on Gabidulin codes
- Theory of codes with maximum rank distance
- A general theory of Vandermonde matrices
- Vandermonde and Wronskian matrices over division rings
- Pseudo linear transformations and evaluation in Ore extensions
- Matroidal structure of skew polynomial rings with application to network coding
- Linear codes using skew polynomials with automorphisms and derivations
- NONCOMMUTATIVE POLYNOMIAL MAPS
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- Convolutional Codes With Maximum Column Sum Rank for Network Streaming
- A New Perspective of Cyclicity in Convolutional Codes
- Convolutional Codes in Rank Metric With Application to Random Network Coding
- Polynomial Codes Over Certain Finite Fields
- Hilbert 90 Theorems Over Divison Rings
- On the theory of space-time codes for PSK modulation
- On Metrics for Error Correction in Network Coding
- Universal Secure Network Coding via Rank-Metric Codes
