Equivalent Circulant Graphs associated with a Binary Cyclic Code

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License

Home

Equivalent Circulant Graphs associated with a Binary Cyclic Code

Author:

GEORGE MATHEW

Affiliation:

Department of Mathematics, BCM College Kottayam-686001, Kerala

Email of corresponding author : e- mail : gmathew5616x@gmail.com

http://dx.doi.org/10.22147/jusps-A/280504

Keyword:

Cayley graphs, circulant graphs, adjacency matrix, cyclic codes, generator polynomial, generator matrix.

Issue Date:

October, 2016

Abstract:

Various papers have been written on the theory of circulant graphs ^{3, 6, 8, 10, 11}. Also graphs with circulant adjacency matrices is discussed in⁷. Circulant graphs have important applications to the theory of designs and error correcting codes¹³. The relationship between directed circulant graphs and binary linear codes is established in9. Each binary cyclic code corresponds to an equivalence class of directed circulant graphs. This paper discusses the method of determining the equivalent circulant graphs associated with a binary cyclic code.

Pages:

ISSN:

2319-8044 (Online) - 2231-346X (Print)

Source:

Vol.28 - No.5

PDF:

Click here to download full paper

DOI:

Share This:

Copy the following to cite this article:

GEORGE MATHEW, "Equivalent Circulant Graphs associated with a Binary Cyclic Code", Journal of Ultra Scientist of Physical Sciences, Volume 28, Issue 5, Page Number , 2016

Copy the following to cite this URL:

GEORGE MATHEW, "Equivalent Circulant Graphs associated with a Binary Cyclic Code", Journal of Ultra Scientist of Physical Sciences, Volume 28, Issue 5, Page Number , 2016

Available from: https://www.ultrascientist.org/paper/596/

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License