251. The distance function on Coxeter-like graphs and self-dual codesMarko Orel, Draženka Višnjić, 2025, izvirni znanstveni članek Povzetek: Let SGLn(F2) be the set of all invertible n×n symmetric matrices over the binary field F2. Let Γn be the graph with the vertex set SGLn(F2) where a pair of matrices {A,B} form an edge if and only if 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∈SGLn(F2). The diameter of Γn is computed. For odd n≥3, it is shown that each matrix A∈SGLn(F2) such that d(A,I)=n+52 and rank(A−I)=n+12 where I is the identity matrix induces a self-dual code in Fn+12. Conversely, each self-dual code C induces a family FC of such matrices A. The families given by distinct self-dual codes are disjoint. The identification C↔FC provides a graph theoretical description of self-dual codes. A result of Janusz (2007) is reproved and strengthened by showing that the orthogonal group On(F2) acts transitively on the set of all self-dual codes in Fn+12. Ključne besede: Coxeter graph, invertible symmetric matrices, binary field, rank, distance in graphs, alternate matrices, self-dual codes Objavljeno v DiRROS: 31.01.2025; Ogledov: 112; Prenosov: 64
Celotno besedilo (1,96 MB) Gradivo ima več datotek! Več... |
252. |
253. |
254. |
255. |
256. |
257. |
258. |
259. |
260. |