Abbas Alhakim

Dr. Abbas Alhakim


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 August 2010 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
AAAbbas Alhakim
Abbas Alhakim
MAMufutau Akinwande
Mufutau Akinwande

1 December 2016 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
AAAbbas Alhakim
Abbas Alhakim
MNMaher Nouiehed
Maher Nouiehed

2 September 2024 in Cryptography and Communications
Verified
Journal Article
Open access
PDF file
AAAbbas Alhakim
Abbas Alhakim
CMChris J. Mitchell
Chris J. Mitchell
JSJanusz Szmidt
Janusz Szmidt
PWPeter R. Wild
Peter R. Wild
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either direction. In particular we establish how two variants of a generalised Lempel homomorphism can be used to recursively construct such sequences, generalising previous work on the binary case. We also derive an upper bound on the period of an orientable sequence.

4 November 2024 in ACM Transactions on Algorithms
Verified
Journal Article
Open access
ESEvan Sala
Evan Sala
JSJoe Sawada
Joe Sawada
AAAbbas Alhakim
Abbas Alhakim
The greedy Prefer-same de Bruijn sequence construction was first presented by Eldert, Gray, Gurk, and Rubinoff in 1958. As a greedy algorithm, it has one major downside: it requires an exponential amount of space to store the length \(2^{n}\) de Bruijn sequence. Though de Bruijn sequences have been heavily studied over the last 60 years, finding an efficient construction for the Prefer-same de Bruijn sequence has remained a tantalizing open problem. In this article, we unveil the underlying structure of the Prefer-same de Bruijn sequence and solve the open problem by presenting an efficient algorithm to construct it using \(O(n)\) time per bit and only \(O(n)\) space. Following a similar approach, we also present an efficient algorithm to construct the Prefer-opposite de Bruijn sequence.

8 December 2010 in arXiv
Verified
Preprint
Open access
PDF file
AAAbbas Alhakim
Abbas Alhakim
A nonbinary Ford sequence is a de Bruijn sequence generated by simple rules that determine the priorities of what symbols are to be tried first, given an initial word of size $n$ which is the order of the sequence being generated. This set of rules is generalized by the concept of a preference function of span $n-1$, which gives the priorities of what symbols to appear after a substring of size $n-1$ is encountered. In this paper we characterize preference functions that generate full de Bruijn sequences. More significantly, We establish that any preference function that generates a de Bruijn sequence of order $n$ also generates de Bruijn sequences of all orders higher than $n$, thus making the Ford sequence no special case. Consequently, we define the preference function complexity of a de Bruijn sequence to be the least possible span of a preference function that generates this de Bruijn sequence.

8 June 2018 in arXiv
Verified
Preprint
Open access
PDF file
AAAbbas Alhakim
Abbas Alhakim
We present a symbolic decomposition of the Pearson chi-square statistic with unequal cell probabilities, by presenting Hadamard-type matrices whose columns are eigenvectors of the variance-covariance matrix of the cell counts. All of the eigenvectors have non-zero values so each component test uses all cell probabilities in a way that makes it intuitively interpretable. When all cell probabilities are distinct and unrelated we establish that such decomposition is only possible when the number of multinomial cells is a small power of 2. For higher powers of 2, we show, using the theory of orthogonal designs, that the targeted decomposition is possible when appropriate relations are imposed on the cell probabilities, the simplest of which is when the probabilities are equal and the decomposition is reduced to the one obtained by Hadamard matrices. Simulations are given to illustrate the sensitivity of various components to changes in location, scale skewness and tail probability, as well as to illustrate the potential improvement in power when the cell probabilities are changed.