In this paper, we aim at utilizing the Cayley tables demonstrated by the Authors[1] in the construction of a Generator/Parity check Matrix in standard form for a Code say C Our goal is achieved first by converting the Cayley tables in [1] using Mod2 arithmetic into a Matrix with entries from the binary field. Echelon Row operations are then performed (carried out) on the matrix in line with existing algorithms and propositions to obtain a matrix say G whose rows spans C and a matrix say H whose rows spans , the dual code of C, where G and H are given as, G = (I k | X) and H= (-X T |I n-k). The report by Williem (2011) that the adjacency Matrix of a graph can be interpreted as the generator matrix of a Code [3] is in this context extended to the Cayley table which generates matrices from the permutations of points of the AUNU numbers of prime cardinality.
The 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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.