Implementing Line-Hermitian Grassmann codes
Ilaria Cardinali, Luca Giuzzi
TL;DR
This paper develops an algorithm for enumerating points in line Hermitian Grassmannians, enabling efficient encoding, decoding, and error correction for the associated codes, building on prior theoretical parameter determinations.
Contribution
It presents a practical enumeration algorithm for line Hermitian Grassmannians, facilitating implementation of efficient coding and error correction methods.
Findings
Algorithm for point enumeration in line Hermitian Grassmannians
Enhanced encoding and decoding procedures for related codes
Potential improvements in error correction efficiency
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.