New LMRD bounds for constant dimension codes and improved constructions
Daniel Heinlein
TL;DR
This paper generalizes upper bounds for constant dimension codes, leading to improved code constructions, which enhance the efficiency and capacity of such codes in network coding applications.
Contribution
It introduces generalized bounds for constant dimension codes and demonstrates how to construct improved codes based on these bounds.
Findings
Derived new upper bounds for constant dimension codes.
Constructed improved codes surpassing previous bounds.
Enhanced the theoretical understanding of code capacities.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding · graph theory and CDMA systems