New constructions of cyclic subspace codes

Publication date 24 May 2023

Abstract: A subspace of a finite field is called a Sidon space if the product of any two of its nonzero elements is unique up to a scalar multiplier from the base field. Sidon spaces, introduced by Roth et al. (IEEE Trans Inf Theory 64(6): 4412-4422, 2018), have a close connection with optimal full-length orbit codes. In this paper, we present two constructions of Sidon spaces. The union of Sidon spaces from the first construction yields cyclic subspace codes in

m a t h c a l G_{q} (n, k)

with minimum distance

2 k - 2

and size

r (l c e i l f r a c n 2 r k c e i l - 1) ((q^{k} - 1)^{r} (q^{n} - 1) + f r a c (q^{k} - 1)^{r - 1} (q^{n} - 1) q - 1)

, where

k | n

,

r g e q 2

and

n g e q (2 r + 1) k

,

m a t h c a l G_{q} (n, k)

is the set of all

k

-dimensional subspaces of

m a t h b b F_{q}^{n}

. The union of Sidon spaces from the second construction gives cyclic subspace codes in

m a t h c a l G_{q} (n, k)

with minimum distance

2 k - 2

and size

l f l o o r f r a c (r - 1) (q^{k} - 2) (q^{k} - 1)^{r - 1} (q^{n} - 1) 2 f l o o r

where

n = 2 r k

and

r g e q 2

. Our cyclic subspace codes have larger sizes than those in the literature, in particular, in the case of

n = 4 k

, the size of our resulting code is within a factor of

f r a c 12 + o_{k} (1)

of the sphere-packing bound as

k

goes to infinity.

This page was built for publication: New constructions of cyclic subspace codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6437900)