Partial spreads in random network coding
From MaRDI portal
Publication:2637329
DOI10.1016/j.ffa.2013.11.007zbMath1288.94107arXiv1306.5609OpenAlexW2962878445MaRDI QIDQ2637329
Alberto Ravagnani, Elisa Gorla
Publication date: 11 February 2014
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.5609
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25)
Related Items (16)
Flag codes of maximum distance and constructions using Singer groups ⋮ Optimum distance flag codes from spreads via perfect matchings in graphs ⋮ Construction of subspace codes through linkage ⋮ The maximum size of a partial spread in a finite projective space ⋮ Almost affinely disjoint subspaces and covering Grassmannian codes ⋮ Equidistant subspace codes ⋮ Message encoding and retrieval for spread and cyclic orbit codes ⋮ Constructions of optimum distance full flag codes ⋮ Flag codes from planar spreads in network coding ⋮ The maximum size of a partial spread. II: Upper bounds ⋮ Partition-balanced families of codes and asymptotic enumeration in coding theory ⋮ A construction of abelian non-cyclic orbit codes ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces ⋮ Hamming and simplex codes for the sum-rank metric ⋮ Flag codes: distance vectors and cardinality bounds ⋮ Subspace codes from Ferrers diagrams
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algebraic approach for decoding spread codes
- Extremal sizes of subspace partitions
- The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
- Partial t-spreads and group constructible \((s,r,\mu)\)-nets
- Partial spreads in finite projective spaces and partial designs
- On t-covers in finite projective spaces
- Coding for Errors and Erasures in Random Network Coding
- Network information flow
- Linear network coding
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Error-Correcting Codes in Projective Space
This page was built for publication: Partial spreads in random network coding