Implementing Line-Hermitian Grassmann codes
arXiv:1804.03024 · doi:10.1016/j.laa.2019.06.020
Abstract
In [I. Cardinali and L. Giuzzi. Line Hermitian Grassmann codes and their parameters. Finite Fields Appl., 51: 407-432, 2018] we introduced line Hermitian Grassmann codes and determined their parameters. The aim of this paper is to present (in the spirit of [I. Cardinali and L. Giuzzi. Enumerative coding for line polar Grassmannians with applications to codes. Finite Fields Appl., 46:107-138, 2017]) an algorithm for the point enumerator of a line Hermitian Grassmannian which can be usefully applied to get efficient encoders, decoders and error correction algorithms for the aforementioned codes.
arXiv comment26 pages
References in corpus (8)
- Decomposable Subspaces, Linear Sections of Grassmann Varieties, and Higher Weights of Grassmann Codes
- Automorphism groups of Grassmann codes
- Codes and caps from orthogonal Grassmannians
- Minimum distance of Symplectic Grassmann codes
- Minimum distance of Line Orthogonal Grassmann Codes in even characteristic
- Line Hermitian Grassmann Codes and their Parameters
- Enumerative Coding for Line Polar Grassmannians with applications to codes
- Grassmann embeddings of polar Grassmannians