Abstract
For any prime p and n ⋛ 3, we examine p-ary linear codes generated by incidence matrices of two classes of graphs, H n and Γ n where H n−1 is an induced subgraph of Γ n . Γ n is a subgraph of the union of the categorical product of triangular graphs T n and complete graphs K n , and complements of triangular graphs T n and K n , where the union of graphs is as defined in [4]. For the codes of H n , we exhibit permutation decoding sets of order n for full error correction. Their size is only twice the lower bound due to Gordon [7]. We also consider partial permutation decoding for the binary codes from Γ n .
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 callDisclaimer: 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.
