65 citations · 108 across the 23 of their papers we have counts for
26 papers
Resolution of an Open Problem on Quasi-Cyclic Codes over and New Quaternary Linear Codes
Nuh Aydin, Aditya Tyagi
Given a cyclic code of odd length over , one common way to build a quasi-cyclic (QC) code is to pick $f_1, \dots, f_\ell \in \mathbb{…
On the History of the Square and Multiply Algorithm
Nuh Aydin, Mohammad K. Azarian, Omid Khormali +1
The square-and-multiply algorithm, also known as binary exponentiation or repeated squaring, is a standard method for fast exponentiation in modern computation. Its historical orig…
Gap-Sums via Quasi-Arithmetic Means with Applications to Fibonacci and Lucas Sequences
Omid Khormali, Ghaya Mtimet, Nuh Aydin +1
We develop a unified framework for studying the integers missing between consecutive terms of an increasing integer sequence, extending Barry's arithmetic gap-sum to geometric and…
New Codes from Cyclic and Negacyclic Codes of Even Length over
Nuh Aydin, Mohamed O. Belghith, Godwin Idowu +2
This paper uses theoretical results previously established in the literature to design search algorithms to find new linear codes over from cyclic and negacyclic cod…
From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
Omid Khormali, Ghaya Mtimet, Nuh Aydin
Motivated by a historical combinatorial problem that resembles the well-known Josephus problem, we investigate circular partition algorithms and formulate problems in deterministic…
Elementary Constructions of Best Known Quantum Codes
Nuh Aydin, Trang T. T. Nguyen, Long B. Tran
Recently, many good quantum codes over various finite fields have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We…