Partial spreads in random network coding
From MaRDI portal
Publication:2637329
DOI10.1016/j.ffa.2013.11.007zbMath1288.94107arXiv1306.5609MaRDI 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
Related Items
Subspace codes from Ferrers diagrams, Almost affinely disjoint subspaces and covering Grassmannian codes, Constructions of optimum distance full flag codes, Construction of subspace codes through linkage, The maximum size of a partial spread. II: Upper bounds, Hamming and simplex codes for the sum-rank metric, Optimum distance flag codes from spreads via perfect matchings in graphs, Equidistant subspace codes, Message encoding and retrieval for spread and cyclic orbit codes, Flag codes from planar spreads in network coding, An asymptotically optimal construction of almost affinely disjoint subspaces, Flag codes: distance vectors and cardinality bounds, Flag codes of maximum distance and constructions using Singer groups, Partition-balanced families of codes and asymptotic enumeration in coding theory, A construction of abelian non-cyclic orbit codes, The maximum size of a partial spread in a finite projective space
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
