A bound on the size of linear codes
Eleonora Guerrini, Massimiliano Sala
TL;DR
This paper introduces a new bound on the size of linear codes that is independent of existing bounds like the Griesmer bound, providing a novel theoretical limit in coding theory.
Contribution
The paper proposes a new bound on linear code size that is distinct from and independent of previously known bounds.
Findings
New bound on linear code size introduced
Bound is independent of the Griesmer bound
Provides a theoretical limit for code design
Abstract
We present a bound on the size of linear codes. This bound is independent of other known bounds, e.g. the Griesmer bound.
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
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Interconnection Networks and Systems