An Upper Bound on the Minimum Weight of Type II 2k-Codes

Abstract

In this paper, we give a new upper bound on the minimum Euclidean weight of Type II 2k-codes and the concept of extremality for the Euclidean weights when k=3,4,5,6. Together with the known result, we demonstrate that there is an extremal Type II 2k-code of length 8m (m 8) when k=3,4,5,6.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…