Codes from adjacency matrices of uniform subset graphs

dc.contributor.author	Fish, W.
dc.contributor.author	Key, J. D.
dc.contributor.author	Mwambene, Eric
dc.date.accessioned	2017-12-11T11:58:43Z
dc.date.available	2017-12-11T11:58:43Z
dc.date.issued	2017
dc.identifier.citation	Fish, W. et al. (2017). Codes from adjacency matrices of uniform subset graphs. Graphs and Combinatorics, 1-30	en_US
dc.identifier.issn	0911-0119
dc.identifier.uri	http://dx.doi.org/10.1007/s00373-017-1862-8
dc.identifier.uri	http://hdl.handle.net/10566/3314
dc.description.abstract	Studies of the p-ary codes from the adjacency matrices of uniform subset graphs Γ(n,k,r)Γ(n,k,r) and their reflexive associates have shown that a particular family of codes defined on the subsets are intimately related to the codes from these graphs. We describe these codes here and examine their relation to some particular classes of uniform subset graphs. In particular we include a complete analysis of the p-ary codes from Γ(n,3,r)Γ(n,3,r) for p≥5p≥5 , thus extending earlier results for p=2,3p=2,3 .	en_US
dc.language.iso	en	en_US
dc.publisher	Springer	en_US
dc.rights	This is the author-version of the article published online at: http://dx.doi.org/10.1007/s00373-017-1862-8
dc.subject	Uniform subset graphs	en_US
dc.subject	Codes	en_US
dc.subject	Graphs	en_US
dc.title	Codes from adjacency matrices of uniform subset graphs	en_US
dc.type	Article	en_US
dc.privacy.showsubmitter	FALSE
dc.status.ispeerreviewed	TRUE