Cliques in projective space and construction of Cyclic Grassmannian Codes

The construction of Grassmannian codes in some projective space is of highly mathematical nature and requires strong computational power for the resulting searches. In this paper was constructed, using GAP System for Computational Discrete Algebra and Wolfram Mathematica, cliques in the projective space Pq(n) and then we use these to produce cyclic Grassmannian codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2019

Skew Constacyclic and LCD Codes over F_q+v F_q

The aim of this paper is to give conditions for the equivalency between ...
research
08/20/2018

On cyclic codes of length 2^e over finite fields

Professor Cunsheng Ding gave cyclotomic constructions of cyclic codes wi...
research
05/28/2021

Extended Cyclic Codes Sandwiched Between Reed-Muller Codes

The famous Barnes-Wall lattices can be obtained by applying Construction...
research
08/11/2022

Two Classes of Constacyclic Codes with Variable Parameters

Constacyclic codes over finite fields are a family of linear codes and c...
research
04/03/2020

A Quadratic Form Approach to Construction A of Lattices over Cyclic Algebras

We propose a construction of lattices from (skew-) polynomial codes, by ...
research
01/02/2022

A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It

We prove a new lower bound on the field size of locally repairable codes...
research
10/21/2022

Cyclic codes from low differentially uniform functions

Cyclic codes have many applications in consumer electronics, communicati...

Please sign up or login with your details

Forgot password? Click here to reset