Backend
New Results on the Subfield Metric
arXiv math.IT0 views
arXiv:2611.18228v1 Announce Type: new Abstract: In this paper, we further develop the theory of the recently introduced $\lambda$-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 $\lambda$-subfield Distance (M$\lambda$D) codes. We establish structural restrictions on their parameters and extend the theory to sublinear codes. We then investigate the asymptotic density of M$\lambda$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 $\lambda>1$. Finally, we complement the collection of classical coding-theoretic bounds available for the $\lambda$-subfield metric by deriving Griesmer-, Elias- and Johnson-type bounds.
Source:https://arxiv.org/abs/2611.18228PreviousMovable Antenna-Aided ISAC: A Time- and Frequency-Division FrameworkNextBeyond Blossom: Accelerating MWPM Decoding for Surface Codes With Local Predecoding and Architecture-Aware Optimizations
Related posts
Building Mobile Connectivity in Afghanistan: A Look at Roshan
0dev.to
Your Tests Blocked System.exit With a SecurityManager and Java 25 Will Not Let You Install One
0dev.to
We autoscaled our Java pricing service on memory and it grew to twenty pods and stayed there
0dev.to
Nine small tools I stopped installing apps for
0dev.to
I built a small tool to capture website screenshots across devices
0dev.to Productivity
What a 13-agent Claude Code team taught me about agent harnesses
0dev.to Productivity