1 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2026
Spanning tight components in 4-uniform hypergraphs
Francesco Di Braccio, Brian Hearn, Joanna Lada +2
We prove that every -vertex 4-uniform hypergraph with minimum codegree at least has a spanning tight component. This is tight, and it settles the 4-uniform…
cs.IT2019★ 1 cited
On the 2-adic complexity of a class of binary sequences of period with optimal autocorrelation magnitude
Minghui Yang, Lulu Zhang, Keqin Feng
Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences of period with optimal autocorrelation magnitude was constructed in \cite{W. Su}. Later, Fan showed…
cs.IT2019★ 1 cited
On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences
Lulu Zhang, Jun Zhang, Minghui Yang +1
We determine the 2-adic complexity of the Ding-Helleseth-Martinsen (DHM) binary sequences by using cyclotomic numbers of order four, "Gauss periods" and "quadratic Gauss sum" on fi…