Binary codes from Paley graphs of prime-power-square order
From MaRDI portal
Publication:2329171
DOI10.1016/j.disc.2019.07.004zbMath1421.94113OpenAlexW2966016447MaRDI QIDQ2329171
Publication date: 17 October 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.07.004
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Permutation decoding of codes from generalized Paley graphs
- A characterization of graphs by codes from their incidence matrices
- Codes from incidence matrices and line graphs of Paley graphs
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs
- Codes from incidence matrices and line graphs of Hamming graphs
- Information sets in quadratic-residue codes
- On the \(p\)-ranks of net graphs
- The Magma algebra system. I: The user language
- Partial permutation decoding for codes from finite planes
- Codes from incidence matrices of graphs
- On coverings
- PD-sets for the codes related to some classical varieties
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)