Theory of supports for linear codes endowed with the sum-rank metric
From MaRDI portal
Publication:2324767
DOI10.1007/s10623-019-00619-8zbMath1419.94042arXiv1808.02468OpenAlexW2887564199MaRDI QIDQ2324767
Publication date: 12 September 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.02468
Hamming metricrank metricsum-rank metricwire-tap channelgeneralized sum-rank weightsMSRD codesmultishot matrix-multiplicative channelsum-rank support
Related Items
Sum-rank product codes and bounds on the minimum distance ⋮ 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 ⋮ Constructions of optimal rank-metric codes from automorphisms of rational function fields ⋮ Doubly and triply extended MSRD codes ⋮ Some matroids related to sum-rank metric codes ⋮ A new rank metric for convolutional codes ⋮ Wei-type duality theorems for rank metric codes ⋮ Hamming and simplex codes for the sum-rank metric ⋮ The geometry of one-weight codes in the sum-rank metric ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications
Uses Software
Cites Work
- On defining generalized rank weights
- The matroid of supports of a linear code
- Almost MDS codes
- On (partial) unit memory codes based on Gabidulin codes
- Generalized weights: an anticode approach
- Theory of codes with maximum rank distance
- A general theory of Vandermonde matrices
- Vandermonde and Wronskian matrices over division rings
- The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
- 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
- Defining the \(q\)-analogue of a matroid
- Weight distribution of rank-metric codes
- Concatenation of convolutional codes and rank metric codes for multi-shot network coding
- Evaluation and interpolation over multivariate skew polynomial rings
- Theory of non-commutative polynomials
- On the existence of error-correcting pairs
- Rank error-correcting pairs
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Linear codes using skew polynomials with automorphisms and derivations
- MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings
- 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
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
- Convolutional Codes in Rank Metric With Application to Random Network Coding
- Explicit Maximally Recoverable Codes With Locality
- Generalized rank weights: A duality statement
- Isometries for rank distance and permutation group of gabidulin codes
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- Some New Characters on the Wire-Tap Channel of Type II
- Coding for Errors and Erasures in Random Network Coding
- Generalized Hamming weights for linear codes
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- Almost-MDS and near-MDS codes for error detection
- Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks
- Private Information Retrieval from Coded Databases with Colluding Servers
- Error Detecting and Error Correcting Codes
- On the design of algebraic space-time codes for MIMO block-fading channels
- Bounds on the minimum support weights
- Dimension/length profiles and trellis complexity of linear block codes
- Geometric approach to higher weights
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
- Universal Secure Network Coding via Rank-Metric Codes
- Partial-MDS Codes and Their Application to RAID Type of Architectures
- Covering Radius of Matrix Codes Endowed with the Rank Metric
- Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes
- Secure Computation from Random Error Correcting Codes
- Maximum distance<tex>q</tex>-nary codes
- Maximum-rank array codes and their application to crisscross error correction
- Wire-Tap Channel II
This page was built for publication: Theory of supports for linear codes endowed with the sum-rank metric
