Theory advances on subfield metric codes reveal structural and density insights
New Results on the Subfield Metric
Information Theory
Summary
This paper explores a special way to measure distances in codes, called the lambda-subfield metric, which helps understand error-correcting codes better. The authors study the best possible codes under this metric, discovering new rules about their structure and frequency in large systems. They also find new mathematical limits that codes must follow and identify specific code families that meet these limits. Finally, they add new versions of classic bounds used in coding theory to this setting. These results help deepen understanding of code design using this newer metric.
What this means in practice
- •For network protocol designers: Design more efficient error-correcting codes by understanding structural limits under the lambda-subfield metric.
- •For secure storage engineers: Develop storage solutions that use optimized codes meeting new bounds for error resilience in data recovery.
A theory result. No direct application yet.
Authors
Ana Kosovac, Jeanette Plechinger, Nikola Spirovski, Violetta Weger
Abstract
In this paper, we further develop the theory of the recently introduced $λ$-subfield metric. We investigate extremal codes, classical bounds and asymptotic densities in this setting. We first study codes attaining a Singleton-type bound, called Maximum $λ$-subfield Distance (M$λ$D) codes. We establish structural restrictions on their parameters and extend the theory to sublinear codes. We then investigate the asymptotic density of M$λ$D codes in several parameter regimes and compare their behavior with that of MDS and MRD codes. We then turn to a Plotkin-like bound, where we construct a family of constant-weight codes attaining the bound and classify all non-degenerate linear constant-weight codes for $λ>1$. Finally, we complement the collection of classical coding-theoretic bounds available for the $λ$-subfield metric by deriving Griesmer-, Elias- and Johnson-type bounds.