Optimal subspace codes in PG(4,q)

02/27/2018
by   Antonio Cossidente, et al.
0

We investigate subspace codes whose codewords are subspaces of PG(4,q) having non-constant dimension. In particular, examples of optimal mixed-dimension subspace codes are provided, showing that A_q(5,3) = 2(q^3+1).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2019

Combining subspace codes

In the context of constant–dimension subspace codes, an important proble...
research
09/12/2020

On the security of subspace subcodes of Reed-Solomon codes for public key encryption

This article discusses the security of McEliece-like encryption schemes ...
research
05/04/2021

Intersection Patterns in Optimal Binary (5,3) Doubling Subspace Codes

Subspace codes are collections of subspaces of a projective space such t...
research
08/25/2020

The Index of Invariance and its Implications for a Parameterized Least Squares Problem

We study the problem x_b,ω := arg min_x ∈𝒮(A + ω I)^-1/2 (b - Ax)_2, wit...
research
11/12/2018

Subspace Packings

The Grassmannian G_q(n,k) is the set of all k-dimensional subspaces of ...
research
10/17/2018

Properties of Constacyclic Codes Under the Schur Product

For a subspace W of a vector space V of dimension n, the Schur-product s...
research
09/04/2013

Some Options for L1-Subspace Signal Processing

We describe ways to define and calculate L_1-norm signal subspaces which...

Please sign up or login with your details

Forgot password? Click here to reset