  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.
