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
Clustering App Ad Hooks in Go: TF-IDF, Cosine Similarity and a Hand-Labelled Sample, and the Walls You'll Hit (2026)
0dev.to
Building a Simple REST API with FastAPI: A Step-by-Step Guide for Beginners
0dev.to
What It Takes to Trust an AI Agent With Real Work
0dev.to
How to check that a PDF converter does not upload your file anywhere
0dev.to
One TPU v6e chip holds 927 agent sessions with host-held state and 5 with a kept chat (memory only)
0dev.to
How to redesign a website without losing Google rankings
0dev.to UX