Systematic maximum sum rank codes
From MaRDI portal
Publication:2191820
DOI10.1016/j.ffa.2020.101677zbMath1444.15015arXiv2001.07198OpenAlexW3016740036MaRDI QIDQ2191820
Umberto Martínez-Peñas, D. Napp Avelli, P. J. Almeida
Publication date: 26 June 2020
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.07198
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Convolutional codes (94B10) Toeplitz, Cauchy, and related matrices (15B05)
Related Items (3)
A new rank metric for convolutional codes ⋮ Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Superregular matrices and applications to convolutional codes
- Constructing strongly-MDS convolutional codes with maximum distance profile
- On superregular matrices and MDP convolutional codes
- Theory of codes with maximum rank distance
- Maximum distance separable convolutional codes
- On duals and parity-checks of convolutional codes over \(\mathbb{Z}_{p^r}\)
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- On dually almost MRD codes
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- Some new non-additive maximum rank distance 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
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- A new class of superregular matrices and MDP convolutional codes
- 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
- Streaming Codes for Multicast Over Burst Erasure Channels
- Convolutional Codes in Rank Metric With Application to Random Network Coding
- Strongly-MDS convolutional codes
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- Coding for Errors and Erasures in Random Network Coding
- On lowest density MDS codes
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
- Complete MDP convolutional codes
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
This page was built for publication: Systematic maximum sum rank codes
