Polar Grassmannians and their Codes
classification
🧮 math.CO
cs.ITmath.IT
keywords
codesgrassmannianspolaralgorithmscaseconcisedecodingdescribe
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.