Papers
Topics
Authors
Recent
Search
2000 character limit reached

Veronese subspace codes

Published 1 Jun 2015 in math.CO | (1506.00452v1)

Abstract: Using the correspondence between quadrics of PG(2,q){\rm PG}(2,q) and points of PG(5,q){\rm PG}(5,q), a family of (6,q<sup>3(q<sup>2−1)(q−1)/3+(q<sup>2+1)(q<sup>2+q+1),4;3)q(6,q<sup>3(q<sup>2-1)(q-1)/3+(q<sup>2+1)(q<sup>2+q+1),4;3)_q constant dimension subspace codes is constructed.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.