On Cyclic Codes of Odd Lengths from the Stable Variety of Regular Cayley Graphs

dc.contributor.authorChun P.B
dc.contributor.authorIbrahim A.A
dc.contributor.authorKamoh N.M
dc.date.accessioned2026-03-18T08:35:23Z
dc.date.issued2018
dc.descriptionDOI: 10.13189/ms.2018.060201 http://www.hrpub.org
dc.description.abstractThe use of the adjacency matrix of a graph as a generator matrix for some classes of binary codes had been reported and studied. This paper concerns the utilization of the stable variety of Cayley regular graphs of odd order for efficient interconnection networks as studied, in the area of Codes Generation and Analysis. The Use of some succession scheme in the construction of a stable variety of the Cayley regular graph had been considered. We shall enumerate the adjacency matrices of the regular Cayley graphs so constructed which are of odd order as in [1]. Next, we would show that the Matrices are cyclic and can be used in the generation of cyclic codes of odd lengths.
dc.identifier.urihttps://irepos.unijos.edu.ng/handle/123456789/11524
dc.language.isoen
dc.publisherMathematics and Statistics
dc.relation.ispartofseriesVol.6; Issue 1, Pp., 17-19
dc.subjectCyclic Codes
dc.subjectCyclic Shift
dc.subjectDegree of a Graph
dc.subjectNon-Negative Matrix
dc.subjectRegular Graph
dc.subjectSymmetric Matrix
dc.titleOn Cyclic Codes of Odd Lengths from the Stable Variety of Regular Cayley Graphs
dc.typeArticle

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
18381487857489386291677710496985485438
Size:
241.13 KB
Format:
Unknown data format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:

Collections