32 citations · 91 across the 24 of their papers we have counts for
28 papers
A Trust and Reputation System for IoT Exploiting Distributed Ledger Technology
Seyed Amid Moeinzadeh Mirhosseini, Ali Fanian, T. Aaron Gulliver
The advent of Bitcoin, and consequently Blockchain, has ushered in a new era of decentralization. Blockchain enables mutually distrusting entities to work collaboratively to attain…
Oversampling Log Messages Using a Sequence Generative Adversarial Network for Anomaly Detection and Classification
Amir Farzad, T. Aaron Gulliver
Dealing with imbalanced data is one of the main challenges in machine/deep learning algorithms for classification. This issue is more important with log message data as it is typic…
Log Message Anomaly Detection and Classification Using Auto-B/LSTM and Auto-GRU
Amir Farzad, T. Aaron Gulliver
Log messages are now widely used in software systems. They are important for classification as millions of logs are generated each day. Most logs are unstructured which makes class…
Construction of Isodual Quasi-cyclic Codes over Finite Fields
Fatma-Zahra Benahmed, Kenza Guenda, Aicha Batoul +1
This paper considers the construction of isodual quasi-cyclic codes. First we prove that two quasi-cyclic codes are permutation equivalent if and only if their constituent codes ar…
Self-Dual Skew Cyclic Codes over
Zineb Hebbache, Kenza Guenda, N. Tugba Özzaim +2
In this paper, we give conditions for the existence of Hermitian self-dual cyclic and negacyclic codes over the finite chain ring . By defining…
Linear -Intersection Pairs of Codes and Their Applications
Kenza Guenda, T. Aaron Gulliver, Somphong Jitman +1
In this paper, a linear -intersection pair of codes is introduced as a generalization of linear complementary pairs of codes. Two linear codes are said to be a linear -…
Predicting the Programming Language of Questions and Snippets of StackOverflow Using Natural Language Processing
Kamel Alreshedy, Dhanush Dharmaretnam, Daniel M. German +2
Stack Overflow is the most popular Q&A website among software developers. As a platform for knowledge sharing and acquisition, the questions posted in Stack Overflow usually contai…
SCC: Automatic Classification of Code Snippets
Kamel Alreshedy, Dhanush Dharmaretnam, Daniel M. German +2
Determining the programming language of a source code file has been considered in the research community; it has been shown that Machine Learning (ML) and Natural Language Processi…
Equivalence of Quasi-cyclic Codes over Finite Fields
Kenza Guenda, T. Aaron Gulliver
This paper considers the equivalence problem for quasi-cyclic codes over finite fields. The results obtained are used to construct isodual quasi-cyclic codes.
Constructions of Good Entanglement-Assisted Quantum Error Correcting Codes
Kenza Guenda, Somphong Jitman, T. Aaron Gulliver
Entanglement-assisted quantum error correcting codes (EAQECCs) are a simple and fundamental class of codes. They allow for the construction of quantum codes from classical codes by…
On the performance of optimal double circulant even codes
T. Aaron Gulliver, Masaaki Harada
In this note, we investigate the performance of optimal double circulant even codes which are not self-dual, as measured by the decoding error probability in bounded distance decod…
Simplex and MacDonald Codes over
K. Chatouh, K. Guenda, T. A. Gulliver +1
In this paper, we introduce the homogeneous weight and homogeneous Gray map over the ring $R_{q}=\mathbb{F}_{2}[u_{1},u_{2},\ldots,u_{q}]/\left\langle u_{i}^{2}=0,u_{i}u_{j}=u_{j}u…
On Repeated-Root Constacyclic Codes of Length over Finite Fields
Aicha Batoul, Kenza Guenda, T. Aaron Gulliver
In this paper we investigate the structure of repeated root constacyclic codes of length over with and . We characterize the codes in…
On Some Classes of Linear Codes and their Covering Radius
K. Chatouh, K. Guenda, T. A. Gulliver +1
In this paper we define Simplex and MacDonald Codes of type and and we give the covering radius of these codes.
Upgraded Approximation of Non-Binary Alphabets for Polar Code Construction
Arash Ghayoori, T. Aaron Gulliver
An algorithm is presented for approximating a single-user channel with a prime input alphabet size. The result is an upgraded version of the channel with a reduced output alphabet…
Enumerating Some Fractional Repetition Codes
Srijan Anil, Manish K. Gupta, T. Aaron Gulliver
In a distributed storage systems (DSS), regenerating codes are used to optimize bandwidth in the repair process of a failed node. To optimize other DSS parameters such as computati…
On the Construction of Radio Environment Maps for Cognitive Radio Networks
Zhiqing Wei, Qixun Zhang, Zhiyong Feng +2
The Radio Environment Map (REM) provides an effective approach to Dynamic Spectrum Access (DSA) in Cognitive Radio Networks (CRNs). Previous results on REM construction show that t…
Constructing Polar Codes Using Iterative Bit-Channel Upgrading
Arash Ghayoori, T. Aaron Gulliver
The definition of polar codes given by Arikan is explicit, but the construction complexity is an issue. This is due to the exponential growth in the size of the output alphabet of…
Some Constacyclic Codes over Finite Chain Rings
Aicha Batoul, Kenza Guenda, T. Aaron Gulliver
For an -th power of a unit in a finite chain ring we prove that -constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows…
Repeated Root Constacyclic Codes of Length over
Kenza Guenda, T. Aaron Gulliver
We give the structure of -constacyclic codes of length over with $λ\in \F_{p^r}^*$. We also give the…
On Cyclic DNA Codes
Kenza Guenda, T. Aaron Gulliver
This paper considers cyclic DNA codes of arbitrary length over the ring $R=\F_2[u]/u^4-1$. A mapping is given between the elements of and the alphabet which allow…
Lexicodes over Rings
Kenza Guenda, T. Aaron Gulliver, S. Arash Sheikholeslam
In this paper, we consider the construction of linear lexicodes over finite chain rings by using a -ordering over these rings and a selection criterion. % and a greedy Algorithm…
Self-dual Repeated Root Cyclic and Negacyclic Codes over Finite Fields
Kenza Guenda, T. Aaron Gulliver
In this paper we investigate repeated root cyclic and negacyclic codes of length over with . In the case odd, we give necessary and sufficien…
MDS and Self-dual Codes over Rings
Kenza Guenda, T. Aaron Gulliver
In this paper we give the structure of constacyclic codes over formal power series and chain rings. We also present necessary and sufficient conditions on the existence of MDS code…