Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd
From MaRDI portal
Publication:2364417
DOI10.1007/s00373-017-1775-6zbMath1417.94106OpenAlexW2606062467MaRDI QIDQ2364417
Publication date: 20 July 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1775-6
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items
\(LCD\) codes from adjacency matrices of graphs, On maximal cliques of Cayley graphs over fields, Van Lint-MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Permutation decoding of codes from generalized Paley graphs
- Codes associated with the odd graphs
- A characterization of graphs by codes from their incidence matrices
- Gossiping and routing in second-kind Frobenius graphs
- Codes from incidence matrices and line graphs of Paley graphs
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs
- On generalised Paley graphs and their automorphism groups
- Graphs, designs and codes related to the \(n\)-cube
- On the \(p\)-ranks of the adjacency matrices of distance-regular graphs
- Codes from incidence matrices of graphs
- Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
- Rank of adjacency matrices of directed (strongly) regular graphs
- Cliques and colorings in generalized Paley graphs and an approach to synchronization
