Theory of supports for linear codes endowed with the sum-rank metric
From MaRDI portal
Publication:2324767
Abstract: The sum-rank metric naturally extends both the Hamming and rank metrics in coding theory over fields. It measures the error-correcting capability of codes in multishot matrix-multiplicative channels (e.g. linear network coding or the discrete memoryless channel on fields). Although this metric has already shown to be of interest in several applications, not much is known about it. In this work, sum-rank supports for codewords and linear codes are introduced and studied, with emphasis on duality. The lattice structure of sum-rank supports is given; characterizations of the ambient spaces ( extit{support spaces}) they define are obtained; the classical operations of restriction and shortening are extended to the sum-rank metric; and estimates (bounds and equalities) on the parameters of such restricted and shortened codes are found. Three main applications are given: 1) Generalized sum-rank weights are introduced, together with their basic properties and bounds; 2) It is shown that duals, shortened and restricted codes of maximum sum-rank distance (MSRD) codes are in turn MSRD; 3) Degenerateness and effective lengths of sum-rank codes are introduced and characterized. In an appendix, skew supports are introduced, defined by skew polynomials, and their connection to sum-rank supports is given.
Recommendations
- Hamming and simplex codes for the sum-rank metric
- Codes in the sum-rank metric: fundamentals and applications
- Some matroids related to sum-rank metric codes
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- The geometry of one-weight codes in the sum-rank metric
Cites work
- A general theory of Vandermonde matrices
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- Almost MDS codes
- Almost-MDS and near-MDS codes for error detection
- Bilinear forms over a finite field, with applications to coding theory
- Bounds on the minimum support weights
- Coding for Errors and Erasures in Random Network Coding
- Concatenation of convolutional codes and rank metric codes for multi-shot network coding
- Convolutional Codes in Rank Metric With Application to Random Network Coding
- Convolutional Codes With Maximum Column Sum Rank for Network Streaming
- Covering radius of matrix codes endowed with the rank metric
- Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes
- Defining the \(q\)-analogue of a matroid
- Dimension/length profiles and trellis complexity of linear block codes
- Error detecting and error correcting codes
- Evaluation and interpolation over multivariate skew polynomial rings
- Explicit Maximally Recoverable Codes With Locality
- Generalized Hamming weights for linear codes
- Generalized rank weights: A duality statement
- Generalized weights: an anticode approach
- Geometric approach to higher weights
- Isometries for rank distance and permutation group of gabidulin codes
- Linear codes using skew polynomials with automorphisms and derivations
- MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings
- Maximum distance<tex>q</tex>-nary codes
- Maximum-rank array codes and their application to crisscross error correction
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- On (partial) unit memory codes based on Gabidulin codes
- On defining generalized rank weights
- On the design of algebraic space-time codes for MIMO block-fading channels
- On the existence of error-correcting pairs
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- Partial-MDS Codes and Their Application to RAID Type of Architectures
- Private information retrieval from coded databases with colluding servers
- Rank error-correcting pairs
- Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
- Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
- Secure Computation from Random Error Correcting Codes
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- Some New Characters on the Wire-Tap Channel of Type II
- Structural attacks for public key cryptosystems based on Gabidulin codes
- The matroid of supports of a linear code
- The weight distribution of irreducible cyclic codes with block lengths n₁ ((q^-1)/N)
- Theory of codes with maximum rank distance
- Theory of non-commutative polynomials
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- Universal Secure Network Coding via Rank-Metric Codes
- Vandermonde and Wronskian matrices over division rings
- Weight distribution of rank-metric codes
- Wire-Tap Channel II
Cited in
(19)- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- The geometry of one-weight codes in the sum-rank metric
- Anticodes in the sum-rank metric
- Sum-rank product codes and bounds on the minimum distance
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Systematic maximum sum rank codes
- A new rank metric for convolutional codes
- Duals of linearized Reed-Solomon codes
- Some matroids related to sum-rank metric codes
- A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
- Codes in the sum-rank metric: fundamentals and applications
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- Doubly and triply extended MSRD codes
- New constructions of MSRD codes
- One-weight codes in the sum-rank metric
- On MSRD codes, h-designs and disjoint maximum scattered linear sets
- Invariants for sum-rank metric codes
- Wei-type duality theorems for rank metric codes
- Hamming and simplex codes for the sum-rank metric
This page was built for publication: Theory of supports for linear codes endowed with the sum-rank metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2324767)
