1 citations · 1 across the 11 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
A general construction of Ordered Orthogonal Arrays using LFSRs
Daniel Panario, Mark Saaltink, Brett Stevens +1
In \cite{Castoldi}, $q^t \by (q+1)t$ ordered orthogonal arrays (OOAs) of strength over the alphabet $\FF_q$ were constructed using linear feedback shift register sequences (LFS…
cs.DM2018
On the algorithmic complexity of decomposing graphs into regular/irregular structures
Arash Ahadi, Ali Dehghan, Mohammad-Reza Sadeghi +1
A locally irregular graph is a graph whose adjacent vertices have distinct degrees, a regular graph is a graph where each vertex has the same degree and a locally regular graph is…