2000 character limit reached
Polar Grassmannians and their Codes (1509.07686v1)
Published 25 Sep 2015 in math.CO, cs.IT, and math.IT
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.