Non-minimum tensor rank Gabidulin codes
From MaRDI portal
Publication:2154304
DOI10.1016/j.laa.2022.06.012zbMath1498.14070arXiv2201.08242OpenAlexW4282918655WikidataQ114151394 ScholiaQ114151394MaRDI QIDQ2154304
Giovanni Zini, Daniele Bartoli, Ferdinando Zullo
Publication date: 19 July 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.08242
Linear codes (general theory) (94B05) Finite fields (field-theoretic aspects) (12E20) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Algebraic structures of MRD codes
- Identifiability of parameters in latent structure models with many observed variables
- Theory of codes with maximum rank distance
- On nonsingular tensors and related projective planes
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Bilinear forms over a finite field, with applications to coding theory
- Finite semifields and nonsingular tensors
- The tensor rank of semifields of order 16 and 81
- Finite semifields and projective planes
- Linearized polynomials over finite fields revisited
- Tensor rank is NP-complete
- Connections between scattered linear sets and MRD-codes
- 13. MRD codes: constructions and connections
- A Rank-Metric Approach to Error Control in Random Network Coding
- Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
- On Generic Identifiability of 3-Tensors of Small Rank
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
- Tensor Representation of Rank-Metric Codes
- On the rank of 3×3×3-tensors
- Maximum-rank array codes and their application to crisscross error correction
- Algebraic complexities and algebraic curves over finite fields
- Tensor Codes and Their Invariants
