2000 character limit reached
Polar Grassmannians and their Codes
Published 25 Sep 2015 in math.CO, cs.IT, and math.IT | (1509.07686v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.