AI & ML
The Schur products of some nonbinary narrow-sense antiprimitive BCH codes
arXiv math.IT0 views
arXiv:2611.08945v1 Announce Type: new Abstract: In recent years, the Schur products of linear codes have been extensively studied due to their favorable applications in cryptography. In this paper, we aim to study the parameters of the Schur products of some nonbinary narrow-sense antiprimitive BCH codes. Let $\mathcal{C}_1$ and $\mathcal{C}_2$ be two narrow-sense antiprimitive BCH codes with designed distances $\delta_{1}$ and $\delta_{2}$, respectively, where $2\le \delta_{1},\delta_{2}\le n$. Let $\mathcal{C}_1\star\mathcal{C}_2$ be the Schur product of $\mathcal{C}_1$ and $\mathcal{C}_2$. We present some necessary and sufficient conditions for $\mathcal{C}_1\star\mathcal{C}_2\ne\mathbb{F}_q^n$ by applying some constraints to $\delta_{1}$ and $\delta_{2}$. Furthermore, we determine the dimensions of these products and lower bounds on their minimum distance. Several linear codes with best known parameters are found.
Source:https://arxiv.org/abs/2611.08945PreviousLevenshtein-type bounds for $(a,b)$-avoiding spherical codesNextStabilizing Vector Approximate Message Passing with Circuit-Designed Lag-Lead Damping
Related posts
An Empirical Analysis of Static Analysis Methods for Detection and Mitigation of Code Library Hallucinations
0arXiv cs.SE
TATG: Tracking-Aware Testing Objective for LLM-based Test Generation
0arXiv cs.SE
MCP Server Architecture Patterns for LLM-Integrated Applications
0arXiv cs.SE
Introducing Cluster Efficiency to LLM Serving: Pooling Economical Accelerators over Fast Interconnects
0arXiv cs.DC
Evidence-Linked Radiology Reporting: A Human-Supervised Reference Architecture for Structured Imaging Intelligence
0arXiv cs.HC
Intentmaking and Sensemaking: Human Interaction with AI-Guided Mathematical Discovery
0arXiv cs.HC