🔮
🔮
The Ethereal
New LMRD bounds for constant dimension codes and improved constructions
January 15, 2018 · The Ethereal · 🏛 arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Daniel Heinlein
arXiv ID
1801.04803
Category
math.CO: Combinatorics
Cross-listed
cs.IT
Citations
14
Venue
arXiv.org
Last Checked
2 months ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Combinatorics
🔮
🔮
The Ethereal
On cap sets and the group-theoretic approach to matrix multiplication
🔮
🔮
The Ethereal
Generalized Twisted Gabidulin Codes
🔮
🔮
The Ethereal
Tables of subspace codes
🔮
🔮
The Ethereal
Classification of weighted networks through mesoscale homological features
🔮
🔮
The Ethereal