Abstract

In [6] we introduced line Hermitian Grassmann codes and determined their parameters. The aim of this paper is to present (in the spirit of [4]) 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call