Subspace Polynomials and Cyclic Subspace Codes
Authors:
- Eli Ben-SassonEBEli Ben-Sasson
- Tuvi EtzionTETuvi Etzion
- Ariel GabizonAGAriel Gabizon
- Netanel RavivNRNetanel Raviv
Preprint
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.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMSForum of Mathematics, Pi, 2016
- Error-Correcting Codes in Projective SpaceIEEE Transactions on Information Theory, 2011
- Subspace Polynomials and Limits to List Decoding of Reed–Solomon CodesIEEE Transactions on Information Theory, 2009
- A Rank-Metric Approach to Error Control in Random Network CodingIEEE Transactions on Information Theory, 2008
- Coding for Errors and Erasures in Random Network CodingIEEE Transactions on Information Theory, 2008
- Irreducible trinomials over finite fieldsMathematics of Computation, 2003
- Codes and Anticodes in the Grassman GraphJournal of Combinatorial Theory, Series A, 2002
- A Course in Combinatorics2001
- On Perfect Codes and Related ConceptsDesigns, Codes and Cryptography, 2001
- Anticodes for the Grassman and bilinear forms graphsDesigns, Codes and Cryptography, 1995