Subspace Polynomials and Cyclic Subspace Codes
Information Theory
2015-04-14 v3 math.IT
Abstract
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and decoding algorithms. In this paper we consider such cyclic codes and provide constructions of optimal codes for which their codewords do not have full orbits. We further introduce a new way to represent subspace codes by a class of polynomials called subspace polynomials. We present some constructions of such codes which are cyclic and analyze their parameters.
Cite
@article{arxiv.1404.7739,
title = {Subspace Polynomials and Cyclic Subspace Codes},
author = {Eli Ben-Sasson and Tuvi Etzion and Ariel Gabizon and Netanel Raviv},
journal= {arXiv preprint arXiv:1404.7739},
year = {2015}
}