Adel Alahmadi

most citedThe maximum number of minimal codewords in an

[n, k] -

code

3 citations · 3 across the 2 of their papers we have counts for

collaborators

2 papers

math.RA2012

Leavitt Path Algebras of Finite Gelfand-Kirillov Dimension

A. Alahmadi, H. Alsulami, S. K. Jain +1

Groebner-Shirshov basis and Gelfand-Kirillov dimension of the Leavitt path algebra are derived.

cs.IT2012★ 3 cited

The maximum number of minimal codewords in an $[n, k] -$ code

A. Alahmadi, R. E. L. Aldred, R. dela Cruz +2

Upper and lower bounds are derived for the quantity in the title, which is tabulated for modest values of $n$ and $k .$ An application to graphs with many cycles is given.

Leavitt Path Algebras of Finite Gelfand-Kirillov Dimension

The maximum number of minimal codewords in an [n,k]−code

The maximum number of minimal codewords in an $[n, k] -$ code