The even-weight subcode of a binary Zetterberg code is a cyclic code with generator polynomial g(x) = (x + 1)p(x), where p(x) is the minimum polynomial over GF(2) of an element of order 2m +1 inâ€¦ (More)

The binary Melas code is a cyclic code with generator polynomial g(u)=p(u)p(u)âˆ— where p(u) is a primitive polynomial of odd degree mâ‰¥5 and the âˆ— denotes reciprocation. The even-weight subcode of aâ€¦ (More)

Let G be a graph. The inherent Inj-equitable graph of a graph G (IIE(G)) is the graph with the same vertices as G and any two vertices u and v are adjacent in IIE(G) if they are adjacent inG andâ€¦ (More)

We develop a new framework for analysing finite connected, oriented graphs of valency four, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation.â€¦ (More)

With every odd integer N, is attached an infinite family of irreducible cyclic â„¤<sub>4</sub>-codes, of lengths of the form n = 2<sup>m</sup>- 1/N over N, for some m â‰¤ 3. The correlation performanceâ€¦ (More)

This short exposition is about some commutativity conditions on a semiprime right Goldie Ck-ring. In particular, it is observed here that a semiprime right Goldie Ck-ring with symmetric quotient isâ€¦ (More)