Codes in the Sum-Rank Metric: Fundamentals and Applications
From MaRDI portal
Publication:5863766
DOI10.1561/0100000120zbMath1495.94115OpenAlexW4285296771MaRDI QIDQ5863766
Umberto Martínez-Peñas, Mohannad Shehadeh, Frank R. Kschischang
Publication date: 3 June 2022
Published in: Foundations and Trends® in Communications and Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1561/0100000120
construction of linearized Reed-Solomon codesmaximum sum-rank distance (MSRD) codes with polynomial field sizes
Linear codes (general theory) (94B05) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02)
Related Items (1)
Cites Work
- Fundamental Properties of Sum-Rank-Metric Codes
- Space–Time Codes From Sum-Rank Codes
- Optimal Anticodes, MSRD Codes, and Generalized Weights in the Sum-Rank Metric
- A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices
- On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets
- On Optimal Locally Repairable Codes With Super-Linear Length
- Locally Repairable Convolutional Codes With Sliding Window Repair
- Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
- How Long Can Optimal Locally Repairable Codes Be?
- Constructions of Partial MDS Codes Over Small Fields
- Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes
- Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
- Decoding of Convolutional Codes Over the Erasure Channel
- Refined Coding Bounds and Code Constructions for Coherent Network Error Correction
- Improved Perfect Space-Time Block Codes
- Partial-MDS Codes and Their Application to RAID Type of Architectures
- Fast Sequential Decoding Algorithm Using a Stack
- Maximum-rank array codes and their application to crisscross error correction
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Space-Time Coding
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On (partial) unit memory codes based on Gabidulin codes
- Hamming and simplex codes for the sum-rank metric
- Number theory. An introduction to mathematics
- Network error correction. I: Basic concepts and upper bounds
- Network error correction. II: Lower bounds
- 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
- Mathematical analysis of algebraic sequential coding
- Bilinear forms over a finite field, with applications to coding theory
- Maximum distance separable convolutional codes
- Zur Verallgemeinerung des Bertrandschen Postulates, dass zwischen \(x\) und \(2x\) stets Primzahlen liegen
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- Defining the \(q\)-analogue of a matroid
- Concatenation of convolutional codes and rank metric codes for multi-shot network coding
- Evaluation and interpolation over multivariate skew polynomial rings
- Locally recoverable codes from algebraic curves and surfaces
- Theory of non-commutative polynomials
- Pseudo linear transformations and evaluation in Ore extensions
- 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
- Anticodes in the sum-rank metric
- Sum-rank product codes and bounds on the minimum distance
- Systematic maximum sum rank codes
- Rank-metric codes and \(q\)-polymatroids
- An algorithm for decoding skew Reed-Solomon codes with respect to the skew metric
- Kötter interpolation in skew polynomial rings
- Random construction of partial MDS codes
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- Theory of supports for linear codes endowed with the sum-rank metric
- Matroidal structure of skew polynomial rings with application to network coding
- A new class of superregular matrices and MDP convolutional codes
- Linear codes using skew polynomials with automorphisms and derivations
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Locality and Availability in Distributed Storage
- Convolutional Codes With Maximum Column Sum Rank for Network Streaming
- Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols
- Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs
- Convolutional Codes in Rank Metric With Application to Random Network Coding
- Repair Locality With Multiple Erasure Tolerance
- Locally Repairable Codes
- Explicit Maximally Recoverable Codes With Locality
- Codes With Local Regeneration and Erasure Correction
- A Family of Optimal Locally Recoverable Codes
- On the Locality of Codeword Symbols
- Polynomial Codes Over Certain Finite Fields
- On MDS codes via Cauchy matrices
- The Golden Code: A<tex>$2,times,2$</tex>Full-Rate Space–Time Code With Nonvanishing Determinants
- On maximum-likelihood detection and the search for the closest lattice point
- Strongly-MDS convolutional codes
- On constructions of algebraic space-time codes with AM-PSK constellations satisfying rate-diversity tradeoff
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- Remarks on space-time codes including a new lower bound and an improved code
- Maximum rank distance codes as space~time codes
- A unified framework for tree search decoding: rediscovering the sequential decoder
- Full-diversity, high-rate space-time block codes from division algebras
- Perfect Space–Time Block Codes
- Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
- A Random Linear Network Coding Approach to Multicast
- Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel
- Resilient Network Coding in the Presence of Byzantine Adversaries
- Linear Network Error Correction Codes in Packet Networks
- Constructions of Multiblock Space–Time Coding Schemes That Achieve the Diversity–Multiplexing Tradeoff
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Hilbert 90 Theorems Over Divison Rings
- A sequential decoder for linear block codes with a variable bias-term metric
- Space-time codes for high data rate wireless communication: performance criterion and code construction
- Network information flow
- On the theory of space-time codes for PSK modulation
- Locally Repairable Codes With Unequal Local Erasure Correction
- Speeding up the Sphere Decoder With $H^{\infty }$ and SDP Inspired Lower Bounds
- Maximally Recoverable Codes for Grid-like Topologies
- Error Detecting and Error Correcting Codes
- Optimal Locally Repairable Codes Via Elliptic Curves
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- High-rate codes that are linear in space and time
- A rank criterion for QAM space-time codes
- On the design of algebraic space-time codes for MIMO block-fading channels
- Linear network coding
- Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
- Streaming Codes for Multiplicative-Matrix Channels With Burst Rank Loss
- A universal lattice code decoder for fading channels
- Primitive Normal Bases for Finite Fields
- Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric
- Sum-Rank BCH Codes and Cyclic-Skew-Cyclic Codes
- On Metrics for Error Correction in Network Coding
- Rank-metric codes
- Codes for Distributed Storage
- Constructing Partial MDS Codes from Reducible Algebraic Curves
- A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
This page was built for publication: Codes in the Sum-Rank Metric: Fundamentals and Applications
