Elisa Gorla

Spread codes and spread decoding in network coding

In this paper we introduce the class of spread codes for the use in random network coding. Spread codes are based on the construction of spreads in finite projective geometry. The major contribution of the paper is an efficient decoding algorithm of spread codes up to half the minimum distance.

An Algebraic Approach for Decoding Spread Codes

In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size

Explicit Formulas for Efficient Multiplication in \mathbb{F}_{3^{6m}}

k\times n

Optimal Ferrers Diagram Rank-Metric Codes

with entries in a finite field

A generalized Gaeta’s theorem

\mathbb F_q

Subspace codes from Ferrers diagrams

. Spread codes are a family of optimal codes with maximal minimum distance. We give a minimum-distance decoding algorithm which requires

Cryptanalysis of the CFVZ cryptosystem

\mathcal{O}((n-k)k^3)

Point compression for the trace zero subgroup over a small degree extension field

operations over an extension field

Weight distribution of rank-metric codes

\mathbb F_{q^k}

SYMMETRIC LADDERS AND G-BILIAISON

. Our algorithm is more efficient than the previous ones in the literature, when the dimension