New LMRD bounds for constant dimension codes and improved constructions

01/15/2018
by   Daniel Heinlein, et al.
0

We generalize upper bounds for constant dimension codes containing a lifted maximum rank distance code first studied by Etzion and Silberstein. The proof allows to construct several improved codes.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset