Line Hermitian Grassmann Codes and their Parameters

@article{Cardinali2018LineHG,
  title={Line Hermitian Grassmann Codes and their Parameters},
  author={Ilaria Cardinali and Luca Giuzzi},
  journal={ArXiv},
  year={2018},
  volume={abs/1706.10255}
}

Implementing Line-Hermitian Grassmann codes

Affine Symplectic Grassmann codes

TLDR
A new class of linear codes, called affine symplectic Grassmann codes, are introduced, and their parameters, automorphism group, minimum distance codewords, dual code and other key features are determined.

Affine Hermitian Grassmann Codes

TLDR
A new class of linear codes, called Affine Hermitian Grassman Codes, are introduced, which are the linear codes resulting from an affine part of the projection of the Polar HerMITian Grassmann codes.

Minimum distance of Line Orthogonal Grassmann Codes in even characteristic

A pr 2 01 8 Minimum distance of Orthogonal Line-Grassmann Codes in even characteristic

TLDR
It is shown that for q even all minimum weight codewords are equivalent and that symplectic line-Grassmann codes are proper subcodes of codimension 2n of the orthogonal ones.

References

SHOWING 1-10 OF 29 REFERENCES

Implementing Line-Hermitian Grassmann codes

Minimum distance of Symplectic Grassmann codes

Line polar Grassmann codes of orthogonal type

Minimum distance of Line Orthogonal Grassmann Codes in even characteristic

Codes and caps from orthogonal Grassmannians

Enumerative coding for line polar Grassmannians with applications to codes

The generating rank of the unitary and symplectic Grassmannians

Automorphism groups of Grassmann codes

On the intersection of Hermitian surfaces

Abstract.We provide a description of the configuration arising from intersection of two Hermitian surfaces in PG(3, q), provided that the linear system they generate contains at least a degenerate