Subspace Polynomials and Cyclic Subspace Codes
Authors:
- 21 January 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 62 (3) , 1157-1165
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
Funding Information
- Seventh Framework Programme (240258, 257575)
- Israel Science Foundation (10/12)
This publication has 18 references indexed in Scilit:
- Constructing high order elements through subspace polynomials2012
- 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
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance2008
- A Course in Combinatorics2001
- Anticodes for the Grassman and bilinear forms graphsDesigns, Codes and Cryptography, 1995
- On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding TheorySIAM Journal on Mathematical Analysis, 1987
- Endliche Gruppen I1967
- On a Special Class of PolynomialsTransactions of the American Mathematical Society, 1933