Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.17067 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917651378339840 |
|---|---|
| author | Orel, Marko Višnjić, Draženka |
| author_facet | Orel, Marko Višnjić, Draženka |
| contents | Let $SGL_n(\mathbb{F}_2)$ be the set of all invertible $n\times n$ symmetric matrices over the binary field $\mathbb{F}_2$. Let $Γ_n$ be the graph with the vertex set $SGL_n(\mathbb{F}_2)$ where a pair of matrices $\{A,B\}$ form an edge if and only if $\textrm{rank}(A-B)=1$. In particular, $Γ_3$ is the well-known Coxeter graph. The distance function $d(A,B)$ in $Γ_n$ is described for all matrices $A,B\in SGL_n(\mathbb{F}_2)$. The diameter of $Γ_n$ is computed. For odd $n\geq 3$, it is shown that each matrix $A\in SGL_n(\mathbb{F}_2)$ such that $d(A,I)=\frac{n+5}{2}$ and $\textrm{rank}(A-I)=\frac{n+1}{2}$ where $I$ is the identity matrix induces a self-dual code in $\mathbb{F}_2^{n+1}$. Conversely, each self-dual code $C$ induces a family ${\cal F}_C$ of such matrices $A$. The families given by distinct self-dual codes are disjoint. The identification $C\leftrightarrow {\cal F}_C$ provides a graph theoretical description of self-dual codes. A result of Janusz (2007) is reproved and strengthened by showing that the orthogonal group ${\cal O}_n(\mathbb{F}_2)$ acts transitively on the set of all self-dual codes in $\mathbb{F}_2^{n+1}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_17067 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The distance function on Coxeter-like graphs and self-dual codes Orel, Marko Višnjić, Draženka Combinatorics Information Theory 15B33, 05C12, 94B05, 15A03, 05C50, 15B57 E.4 Let $SGL_n(\mathbb{F}_2)$ be the set of all invertible $n\times n$ symmetric matrices over the binary field $\mathbb{F}_2$. Let $Γ_n$ be the graph with the vertex set $SGL_n(\mathbb{F}_2)$ where a pair of matrices $\{A,B\}$ form an edge if and only if $\textrm{rank}(A-B)=1$. In particular, $Γ_3$ is the well-known Coxeter graph. The distance function $d(A,B)$ in $Γ_n$ is described for all matrices $A,B\in SGL_n(\mathbb{F}_2)$. The diameter of $Γ_n$ is computed. For odd $n\geq 3$, it is shown that each matrix $A\in SGL_n(\mathbb{F}_2)$ such that $d(A,I)=\frac{n+5}{2}$ and $\textrm{rank}(A-I)=\frac{n+1}{2}$ where $I$ is the identity matrix induces a self-dual code in $\mathbb{F}_2^{n+1}$. Conversely, each self-dual code $C$ induces a family ${\cal F}_C$ of such matrices $A$. The families given by distinct self-dual codes are disjoint. The identification $C\leftrightarrow {\cal F}_C$ provides a graph theoretical description of self-dual codes. A result of Janusz (2007) is reproved and strengthened by showing that the orthogonal group ${\cal O}_n(\mathbb{F}_2)$ acts transitively on the set of all self-dual codes in $\mathbb{F}_2^{n+1}$. |
| title | The distance function on Coxeter-like graphs and self-dual codes |
| topic | Combinatorics Information Theory 15B33, 05C12, 94B05, 15A03, 05C50, 15B57 E.4 |
| url | https://arxiv.org/abs/2404.17067 |