The purpose of this paper is two-fold. First we show that Kim’s building-up construction of binary self-dual codes is equivalent to Chinburg-Zhang’s Hilbert symbol construction. Second we introduce a -ary version of Chinburg-Zhang’s construction in order to construct -ary self-dual codes efficiently. For the latter, we study self-dual codes over split finite fields with through three complementary viewpoints: the building-up construction, the binary arithmetic reduction of Chinburg–Zhang, and the hyperbolic geometry of the Euclidean plane. The condition that be a square is the common algebraic input linking these viewpoints: in the binary case it underlies the Lagrangian reduction picture, while in the split -ary case it produces the isotropic line governing the correction terms in the extension formulas. As an application of our efficient form of generator matrices, we construct optimal self-dual codes from the split boxed construction, including self-dual and codes over , MDS self-dual and codes over , and a self-dual code over . These structural statements are accompanied by a Lean~4 formalization of the algebraic core.

生成讲解博客的中文版本

生成AI智能校验的中文版本