Adel Alahmadi

activity

20122017

F_{q} + v F_{q} + v^{2} F_{q}

10 citations · 30 across the 9 of their papers we have counts for

collaborators

Showing cs.ITShow all

8 papers · 1 filter

cs.IT2017★ 5 cited

On linear complementary-dual multinegacirculant codes

Adel Alahmadi, Cem Güneri, Buket Özkaya +2

Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index $2$ that are LCD are characterized algebrai…

cs.IT2017★ 2 cited

Long quasi-polycyclic $t -$ CIS codes

Adel Alahmadi, Cem Güneri, Hatoon Shoaib +1

We study complementary information set codes of length $t n$ and dimension $n$ of order $t$ called ( $t -$ CIS code for short). Quasi-cyclic and quasi-twisted $t$ -CIS codes are enumera…

cs.IT2016

On self-dual double negacirculant codes

Adel Alahmadi, Hatoon Shohaib, Patrick Solé

Double negacirculant (DN) codes are the analogues in odd characteristic of double circulant codes. Self-dual DN codes of odd dimension are shown to be consta-dihedral. Exact counti…

cs.IT2016★ 3 cited

On self-dual double circulant codes

Adel Alahmadi, Funda Özdemir, Patrick Solé

Self-dual double circulant codes of odd dimension are shown to be dihedral in even characteristic and consta-dihedral in odd characteristic. Exact counting formulae are derived for…

cs.IT2015★ 10 cited

Skew cyclic codes over $F_{q} + v F_{q} + v^{2} F_{q}$

Minjia Shi, Ting Yao, Adel Alahmadi +1

In this article, we study skew cyclic codes over ring $R = F_{q} + v F_{q} + v^{2} F_{q}$ , where $q = p^{m}$ , $p$ is an odd prime and $v^{3} = v$ . We describe genera…

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.

cs.IT2012★ 1 cited

Cyclic codes over $M_2(\F_2)$

Adel Alahmadi, Patrick Solé, Houda Sboui +1

The ring in the title is the first non commutative ring to have been used as alphabet for block codes. The original motivation was the construction of some quaternionic modular lat…

cs.IT2012

The maximum number of minimal codewords in long codes

Adel Alahmadi, R. E. L. Aldred, Romar dela Cruz +2

Upper bounds on the maximum number of minimal codewords in a binary code follow from the theory of matroids. Random coding provide lower bounds. In this paper we compare these boun…