Partial spreads in random network coding

DOI10.1016/j.ffa.2013.11.007zbMath1288.94107arXiv1306.5609MaRDI QIDQ2637329

Elisa Gorla, Alberto Ravagnani

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

zbMATH Keywords

random network coding; partial spread

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94B25: Combinatorial codes

Related Items

Subspace codes from Ferrers diagrams, Construction of subspace codes through linkage, The maximum size of a partial spread. II: Upper bounds, Equidistant subspace codes, Message encoding and retrieval for spread and 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