Generalized hypercube graph $\mathcal{Q}_n(S)$, graph products and self-orthogonal codes

Abstract

A generalized hypercube graph $\mathcal{Q}_n(S)$ has $\mathbb{F}_{2}^{n}=\{0,1\}^n$ as the vertex set and two vertices being adjacent whenever their mutual Hamming distance belongs to $S$, where $n \ge 1$ and $S\subseteq \{1,2,\ldots, n\}$. The graph $\mathcal{Q}_n(\{1\})$ is the $n$-cube, usually denoted by $\mathcal{Q}_n$. We study graph boolean products $G_1 = \mathcal{Q}_n(S)\times \mathcal{Q}_1$, $G_2 = \mathcal{Q}_{n}(S)\wedge \mathcal{Q}_1$, $G_3 = \mathcal{Q}_{n}(S)[\mathcal{Q}_1]$ and show that binary codes from neighborhood designs of $G_1, G_2$ and $G_3$ are self-orthogonal for all choices of $n$ and $S$. More over, we show that the class of codes $C_1$ are self-dual. Further we find subgroups of the automorphism group of these graphs and use these subgroups to obtain PD-sets for permutation decoding. As an example we find a full error-correcting PD set for the binary $[32, 16, 8]$ extremal self-dual code.

Received: 19 May 2015 | Accepted: 2 December 2015