Abstract:
For any prime p and n ≥ 3, we examine p-ary linear codes generated by incidence matrices of two classes of graphs, Hn and Γn where Hn-1 is an induced subgraph of Γn. Γn i...Show MoreMetadata
Abstract:
For any prime p and n ≥ 3, we examine p-ary linear codes generated by incidence matrices of two classes of graphs, Hn and Γn where Hn-1 is an induced subgraph of Γn. Γn is a subgraph of the union of the categorical product of triangular graphs Tn and complete graphs Kn, and complements of triangular graphs T̅n and Kn, where the union of graphs is as defined in. For the codes of Hn, we exhibit permutation decoding sets of order n for full error correction. Their size is only twice the lower bound due to Gordon. We also consider partial permutation decoding for the binary codes from Γn.
Published in: 2010 IEEE Information Theory Workshop
Date of Conference: 30 August 2010 - 03 September 2010
Date Added to IEEE Xplore: 30 September 2010
ISBN Information: