New LMRD bounds for constant dimension codes and improved constructions
classification
🧮 math.CO
cs.ITmath.IT
keywords
codesboundsconstantdimensionimprovedallowscodeconstruct
read the original abstract
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.
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.