Affine Hermitian Grassmann Codes

The Grassmannian is an important object in Algebraic Geometry. One of the many techniques used to study the Grassmannian is to build a vector space from its points in the projective embedding and study the properties of the resulting linear code. We introduce a new class of linear codes, called Affine Hermitian Grassman Codes. These codes are the linear codes resulting from an affine part of the projection of the Polar Hermitian Grassmann codes. They combine Polar Hermitian Grassmann codes and Affine Grassmann codes. We will determine the parameters of these codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/04/2022

Affine Symplectic Grassmann codes

In this manuscript, we introduce a new class of linear codes, called aff...
research
12/23/2021

Polar Codes Do Not Have Many Affine Automorphisms

Polar coding solutions demonstrate excellent performance under the list ...
research
08/04/2022

Classification of some cosets of Reed-Muller codes

This note presents a descending method that allows us to classify quotie...
research
05/18/2018

Affine Cartesian codes with complementary duals

A linear code C with the property that C ∩ C^ = {0 } is said to be a lin...
research
05/03/2022

Optimal (r,δ)-LRCs from zero-dimensional affine variety codes and their subfield-subcodes

We introduce zero-dimensional affine variety codes (ZAVCs) which can be ...
research
01/11/2020

Partially symmetric monomial codes

A framework of monomial codes is considered, which includes linear codes...
research
11/04/2022

Minimal codewords in Norm-Trace codes

In this paper, we consider the affine variety codes obtained evaluating ...

Please sign up or login with your details

Forgot password? Click here to reset