Muhammad Ilyas

collaborators

2 papers

cs.DM2025

Counting Tree-Like Multigraphs with a Given Number of Vertices and Multiple Edges

Muhammad Ilyas, Seemab Hayat, Naveed Ahmed Azam

The enumeration of chemical graphs is an important topic in cheminformatics and bioinformatics, particularly in the discovery of novel drugs. These graphs are typically either tree…

cs.IT2013

Generalized Extended Hamming Codes over Galois Ring of Characteristic $2^{n}$

Muhammad Ilyas, Mieko Yamada

In this paper, we introduce generalized extended Hamming codes over Galois rings $GR (2^{n}, m)$ of characteristic $2^{n}$ with extension degree $m$ . Furthermore we prove that the minimu…

Counting Tree-Like Multigraphs with a Given Number of Vertices and Multiple Edges

Generalized Extended Hamming Codes over Galois Ring of Characteristic 2n

Generalized Extended Hamming Codes over Galois Ring of Characteristic $2^{n}$