Abstract
We examine the p-ary linear codes from incidence matrix of the (n, k)-arrangement graphs for k = 2, n –2, n – 1. All the main parameters of the codes are obtained as respectively. We examine also the p-ary linear codes from incidence matrix of graphs such as Ljubljana graph, Heawood graph and the main parameters of the codes are [168, 111, 3] p , [21, 13, 3] p respectively. Any transitive subgroup of automorphism groups of these graphs can be used for full permutation decoding using the corresponding codes. All the above codes can be used for full error correction by permutation decoding.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
