Abstract
Codes from neighbourhood designs of generalized Paley graphs \(GP(q,k)\) of a finite field of order q and their complements are investigated. With certain q and k, we obtain the main parameters of such codes and their duals including bases of minimum-weight vectors for the codes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Assmus Jr., E.F., Key, J.D.: Designs and their Codes, Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge (1993)
Brouwer, A.E., van Eijl, C.A.: On the \(p\)-rank of the adjacency matrices of strongly regular graphs. J. Algebr. Combin. 1, 329–346 (1992)
Dankelmann, P., Key, J.D., Rodrigues, B.G.: A characterization of graphs by codes from their incidence matrices. Electron. J. Combin. 20, #P18 (2013)
Dankelmann, P., Key, J.D., Rodrigues, B.G.: Codes from incidence matrices of graphs. Des. Codes Cryptogr. 68, 373–393 (2013)
Fang, X.G., Zhou, S.: Gossiping and routing in second-kind Frobenius graphs. Eur. J. Combin. 33, 1001–1014 (2012)
Fish, W., Key, J.D., Mwambene, E.: Graphs, designs and codes related to the \(n\)-cube. Discrete Math. 309, 3255–3269 (2009)
Fish, W., Key, J.D., Mwambene, E.: Codes associated with the odd graphs. Discrete Math. 315–316, 102–111 (2014)
Ghinelli, D., Key, J.D.: Codes from incidence matrices and line graphs of Paley graphs. Adv. Math. Commun. 5, 93–108 (2011)
Godsil, C., Royle, G.: Algebraic Graph Theory, Graduate Texts in Mathematics, vol. 207. Springer, New York (2001)
Jørgensen, L.K.: Rank of adjacency matrices of directed (strongly) regular graphs. Linear Algebra Appl. 407, 233–241 (2005)
Key, J.D., Fish, W., Mwambene, E.: Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k\ge 2\). Adv. Math. Commun. 5, 373–394 (2011)
Key, J.D., Limbupasiriporn, J.: Partial permutation decoding for codes from Paley graphs. Congr. Numer. 170, 143–155 (2004)
Lim, T.K., Praeger, C.E.: On generalised Paley graphs and their automorphism groups. Mich. Math. J. 58, 294–308 (2009)
Peeters, R.: On the \(p\)-ranks of the adjacency matrices of distance-regular graphs. J. Algebr. Combin. 15, 127–149 (2002)
Schneider, C., Silva, A.C.: Cliques and colorings in generalized Paley graphs and an approach to synchronization. J. Algebra Appl. 14 (2015). doi:10.1142/S0219498815500887
Seneviratne, P., Limbupasiriporn, J.: Permutation decoding of codes from generalized Paley graphs. Appl. Algebra Eng. Commun. Comput. 24, 225–236 (2013)
Acknowledgements
The author would like to thank the anonymous referee for their helpful comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the Faculty of Science, Silpakorn University, Thailand, under the Grant Number RSF-JRG-2556-01.
Rights and permissions
About this article
Cite this article
Limbupasiriporn, J. Codes from Neighbourhood Designs of the Graphs \(GP(q,\frac{q-1}{2})\) with q Odd. Graphs and Combinatorics 33, 537–548 (2017). https://doi.org/10.1007/s00373-017-1775-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-017-1775-6