AI编程能力边界探索：基于 Claude Code 的 Spec Coding 项目实战｜得物技术

We improve the upper bound of Levenshtein for the cardinality of a code of length 4 capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we will construct an optimal perfect code capable of correcting single deletions for the same parameters.

This paper proposes a new coded modulation scheme for reliable transmission of short data packets at very low signal-to-noise ratio, combining cyclic code shift keying modulation and non-binary polar coding. We consider non-binary polar codes defined over Galois fields, and propose a new design methodology, aimed at optimizing the choice of the kernel coefficients. Numerical results show that the system performance is close to the achievable limits in the finite blocklength regime.