AI & ML
Caps and LCD Codes with Large Dimensions
arXiv math.IT0 views
arXiv:2604.03734v2 Announce Type: replace Abstract: We establish a connection between linear complementary dual (LCD) codes and caps in projective space. Using this framework and the structure theory of maximal binary caps, we derive nonexistence theorems for binary LCD codes with minimum distance at least $4$, providing computation-free proofs that were previously obtained only through exhaustive search. As an application, we completely determine the optimal minimum distances for codimensions $7$ and $8$ for the first time. The framework applies to ternary LCD codes and quaternary Hermitian LCD codes, where it reduces the problem to the structure of large caps. Using known results on large caps, we determine the optimal minimum distances of ternary LCD codes of codimension $6$ for all lengths, and we explain why the phenomena behind the binary nonexistence theorems, such as the dependence on the parity of the length, have no counterpart for these codes.
Source:https://arxiv.org/abs/2604.03734PreviousOn generalized covering radii of binary primitive double-error-correcting BCH codesNextHybrid Multiport Receivers for Slow Fluid Antenna Multiple Access
Related posts

Behavioral Design Unpacked: Nudges, Funnels & Persuasion | UX Unpacked #3
0dev.to UX
National Grid buys Teesside land for UK largest substation to power AI data center
0dev.to News

Leonardo AI Alternative in 2026
0dev.to Discuss

This is my first HacktoberFest, and I don't know what to feel.
0dev.to Discuss

12% of the Economy: The Benchmark That Grades AI Agents Like Employees
0dev.to Machine Learning
A headline said the CMB killed huge black holes. I read the two papers.
0dev.to Career