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
Quiz: How to Set Up a Python Project for Agentic Coding
0Real Python

How Mitts Makes Parallel Rust Builds Faster Than Cargo
0HackerNoon
The internet-dependent mattress has a recovery mode: rooting the Eight Sleep Pod 3 with a GNU tar quirk
0dev.to
How Budgeting Resources for First Input Delay Can Backfire: Tradeoffs and Debugging
0dev.to
Designing the Order Flow for a Custom Children’s Book
0dev.to
I Caught a Pricing Page Change That Would Have Cost Us a Client
0dev.to