Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2601.08008

The punctured dodecacode is unique

Markus Grassl·Denis Krotov·Lin Sok·Patrick Solé
View original source ↗Read source document ↗Export metadata ↓

Abstract

The punctured dodecacode is an additive $4$-ary code of length $11$ and distance $5$ which is uniformly packed. We show that a code with the same weight distribution is equivalent to it. This code is also shown to be nonlinear. We also establish the nonexistence of analogues of the dodecacode and the punctured dodecacode in Doob graphs. To that end, we classify two-weight codes of weights $6$ and $8$ in Doob and $4$-ary Hamming graphs of diameter $9$ and the corresponding strongly regular graphs. Keywords: dodecacode, additive code, trace Hermitian duality, uniformly packed code, completely regular code, Doob graph, strongly regular graph

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Markus Grassl, Denis Krotov, Lin Sok, Patrick Solé. 2026-01-12. The punctured dodecacode is unique. https://arxiv.org/abs/2601.08008

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗