Polar Grassmannians and their Codes
Ilaria Cardinali, Luca Giuzzi
TL;DR
This paper explores Orthogonal Polar Grassmann Codes, providing a clear description, efficient algorithms for encoding and decoding in the case of Line Grassmannians, and highlighting open research questions.
Contribution
It offers a concise description of Polar Grassmann Codes, details efficient algorithms for Line Grassmannians, and introduces open problems for future research.
Findings
Efficient encoding and decoding algorithms for Line Grassmannians.
Clear description of Orthogonal Polar Grassmann Codes.
Identification of open problems in the field.
Abstract
We present a concise description of Orthogonal Polar Grassmann Codes and motivate their relevance. We also describe efficient encoding and decoding algorithms for the case of Line Grassmannians and introduce some open problems.
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.
Taxonomy
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding · Finite Group Theory Research