Subspace codes from Ferrers diagrams
From MaRDI portal
Publication:5272572
DOI10.1142/S0219498817501316zbMath1378.94080arXiv1405.2736OpenAlexW2964314773MaRDI QIDQ5272572
Alberto Ravagnani, Elisa Gorla
Publication date: 30 June 2017
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.2736
Applications to coding theory and cryptography of arithmetic geometry (14G50) Combinatorial codes (94B25) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (13)
Anticodes in the sum-rank metric ⋮ Constant dimension codes from multilevel construction based on matchings of complete hypergraphs ⋮ Almost affinely disjoint subspaces and covering Grassmannian codes ⋮ Optimal Ferrers diagram rank-metric codes from MRD codes ⋮ Generalized block inserting for constructing new constant dimension codes ⋮ Bilateral multilevel construction of constant dimension codes ⋮ Constructions of optimal rank-metric codes from automorphisms of rational function fields ⋮ A note on equidistant subspace codes ⋮ Galois geometries and coding theory ⋮ Improved generalized block inserting construction of constant dimension codes ⋮ Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank ⋮ Several classes of optimal Ferrers diagram rank-metric codes ⋮ Tensor Representation of Rank-Metric Codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rank-metric codes and their duality theory
- An algebraic approach for decoding spread codes
- Generalized weights: an anticode approach
- Subspaces of matrices with special rank properties
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Partial spreads in random network coding
- Optimal Ferrers Diagram Rank-Metric Codes
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Codes and Designs Related to Lifted MRD Codes
- A Random Linear Network Coding Approach to Multicast
- Coding for Errors and Erasures in Random Network Coding
- ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
- Linear network coding
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Universal Grobner Bases for Maximal Minors
- Error-Correcting Codes in Projective Space
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: Subspace codes from Ferrers diagrams
