New Lower Bounds for Constant Dimension Codes
Natalia Silberstein, Anna-Lena Trautmann
TL;DR
This paper introduces new constructive lower bounds for constant dimension codes using innovative techniques, resulting in the largest known codes for certain parameters and advancing the field of coding theory.
Contribution
It presents novel constructions for constant dimension codes employing Ferrers diagram rank metric codes and pending blocks, expanding the known bounds.
Findings
Largest known constant dimension codes for specific parameters
New constructive lower bounds established
Techniques applicable to multiple parameter families
Abstract
This paper provides new constructive lower bounds for constant dimension codes, using different techniques such as Ferrers diagram rank metric codes and pending blocks. Constructions for two families of parameters of constant dimension codes are presented. The examples of codes obtained by these constructions are the largest known constant dimension codes for the given parameters.
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.