
arXiv: 1108.5881
A spread code is a set of vector spaces of a fixed dimension over a finite field Fq with certain properties used for random network coding. It can be constructed in different ways which lead to different decoding algorithms. In this work we present a new representation of spread codes with a minimum distance decoding algorithm which is efficient when the codewords, the received space and the error space have small dimension.
Submitted for publication to Finite Fields and their Applications (Elsevier)
FOS: Computer and information sciences, Grassmannian, spreads, Decoding, projective space, Computer Science - Information Theory, Information Theory (cs.IT), Algebraic coding theory; cryptography (number-theoretic aspects), network coding, Source coding, subspace codes
FOS: Computer and information sciences, Grassmannian, spreads, Decoding, projective space, Computer Science - Information Theory, Information Theory (cs.IT), Algebraic coding theory; cryptography (number-theoretic aspects), network coding, Source coding, subspace codes
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 10 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
