Partial spreads in random network coding

Elisa Gorla; Alberto Ravagnani

doi:10.1016/j.ffa.2013.11.007

Partial spreads in random network coding

Elisa Gorla, Alberto Ravagnani

Research output: Contribution to journal › Article › Academic › peer-review

23 Citations (Scopus)

Abstract

Following an idea in finite projective geometry, we introduce a class of subspace codes which we call partial spread codes. Partial spread codes naturally generalize spread codes. We provide an easy description of such codes in terms of block matrices, establish their maximality, and give an efficient decoding algorithm.

Original language	English
Pages (from-to)	104-115
Number of pages	12
Journal	Finite Fields and their Applications
Volume	26
DOIs	https://doi.org/10.1016/j.ffa.2013.11.007
Publication status	Published - Mar 2014
Externally published	Yes

Keywords

Partial spread
Random network coding

Access to Document

10.1016/j.ffa.2013.11.007

Cite this

@article{5426af0074404464958a021258fb25bb,

title = "Partial spreads in random network coding",

abstract = "Following an idea in finite projective geometry, we introduce a class of subspace codes which we call partial spread codes. Partial spread codes naturally generalize spread codes. We provide an easy description of such codes in terms of block matrices, establish their maximality, and give an efficient decoding algorithm.",

keywords = "Partial spread, Random network coding",

author = "Elisa Gorla and Alberto Ravagnani",

year = "2014",

month = mar,

doi = "10.1016/j.ffa.2013.11.007",

language = "English",

volume = "26",

pages = "104--115",

journal = "Finite Fields and their Applications",

issn = "1071-5797",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Partial spreads in random network coding

AU - Gorla, Elisa

AU - Ravagnani, Alberto

PY - 2014/3

Y1 - 2014/3

N2 - Following an idea in finite projective geometry, we introduce a class of subspace codes which we call partial spread codes. Partial spread codes naturally generalize spread codes. We provide an easy description of such codes in terms of block matrices, establish their maximality, and give an efficient decoding algorithm.

AB - Following an idea in finite projective geometry, we introduce a class of subspace codes which we call partial spread codes. Partial spread codes naturally generalize spread codes. We provide an easy description of such codes in terms of block matrices, establish their maximality, and give an efficient decoding algorithm.

KW - Partial spread

KW - Random network coding

UR - http://www.scopus.com/inward/record.url?scp=84891081820&partnerID=8YFLogxK

U2 - 10.1016/j.ffa.2013.11.007

DO - 10.1016/j.ffa.2013.11.007

M3 - Article

AN - SCOPUS:84891081820

SN - 1071-5797

VL - 26

SP - 104

EP - 115

JO - Finite Fields and their Applications

JF - Finite Fields and their Applications

ER -

Partial spreads in random network coding

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this