Codes associated with circulant graphs and permutation decoding
Article
First Online:
Received:
Revised:
Accepted:
- 177 Downloads
Abstract
Binary codes that can be obtained from designs associated with circulant graphs G(n, S) are studied. The parameters of the codes and the information sets are obtained. PD-sets for full-error correction are found for certain values of n.
Keywords
Codes Circulant graphs Permutation decodingMathematics Subject Classification
05B05 05C90 94B35Preview
Unable to display preview. Download preview PDF.
References
- 1.Assmus E.F. Jr., Key J.D.: Designs and Their Codes. Cambridge Tracts in Mathematics, vol. 103. Cambridge University Press, Cambridge (1992) (Second printing with corrections, 1993)Google Scholar
- 2.Frucht R.: On the groups of repeated graphs. Bull. Am. Math. Soc. 55, 418–520 (1949)CrossRefMATHMathSciNetGoogle Scholar
- 3.Harary F.: The automorphism group of the hypercube. J. Univers. Comput. Sci. 6, 136–138 (2000)MATHGoogle Scholar
- 4.Huffman W.C.: Codes and groups. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, vol. 2, Part 2, Chap. 17, pp. 1345–1440. Elsevier, Amsterdam.Google Scholar
- 5.Key J.D., Seneviratne P.: Permutation decoding of binary codes from lattice graphs. Discrete Math. 308, 2862–2867 (2008)CrossRefMATHMathSciNetGoogle Scholar
- 6.Key J.D., Moori J., Rodrigues B.G.: Permutation decoding for the binary codes from triangular graphs. Eur. J. Comb. 25, 113–123 (2004)CrossRefMATHMathSciNetGoogle Scholar
- 7.MacWilliams F.J.: Permutation decoding of systematic codes. Bell Syst. Tech. J. 43, 485–505 (1964)CrossRefMATHGoogle Scholar
- 8.MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1998)Google Scholar
- 9.Whitney H.: Congruent graphs and the connectivity of graphs. Am. J. Math. 54, 154–168 (1932)CrossRefMathSciNetGoogle Scholar
Copyright information
© Springer Science+Business Media, LLC 2012