## A Characterization of Graphs by Codes from their Incidence Matrices

- Peter Dankelmann, Jennifer D. Key, Bernardo Gabriel Rodrigues
- Electr. J. Comb.
- 2013

@article{Ghinelli2011CodesFI, title={Codes from incidence matrices and line graphs of Paley graphs}, author={Dina Ghinelli and Jennifer D. Key}, journal={Adv. in Math. of Comm.}, year={2011}, volume={5}, pages={93-108} }

- Published 2011 in Adv. in Math. of Comm.
DOI:10.3934/amc.2011.5.93

We examine the p-ary codes from incidence matrices of Paley graphs P (q) where q ≡ 1 (mod 4) is a prime power, and show that the codes are [ q(q−1) 4 , q − 1, q−1 2 ]2 or [ q(q−1) 4 , q, q−1 2 ]p for p odd. By finding PD-sets we show that for q > 9 the p-ary codes, for any p, can be used for permutation decoding for full error-correction. The binary code… CONTINUE READING

### Presentations referencing similar topics