6 papers
Bounds and constructions for constant/low-power error-correcting cooling codes
Shuangqing Liu, Tingting Tong, Menglong Zhang +2
The low-power error-correcting cooling (LPECC) codes and constant-power error-correcting cooling (CPECC) codes, introduced in [IEEE Trans. Inf. Theory, 64 (2018), 3062--3085; 66 (2…
A superlogarithmic saving for Oddtown modulo composite numbers
Yuhao Zhao
Let be the largest size of a family such that no member has size divisible by , while the intersection of every two distinct membe…
Lower bounds on the strength of the determinant
Qiyuan Chen, Yuhao Zhao
We establish new lower bounds for the strength and partition rank of the determinant. For every prime , we prove the exact identity \[ \operatorname{str}(\mathrm{det}_p)=p. \] A…
Counting cliques with prescribed intersection sizes
Yuhao Zhao, Xiande Zhang
We study the generalized Turán problem regarding cliques with restricted intersections, which highlights the motivation from extremal set theory. Let $L=\{\ell_1,\dots,\ell_s\}\su…
On low-power error-correcting cooling codes with large distances
Yuhao Zhao, Xiande Zhang
A low-power error-correcting cooling (LPECC) code was introduced as a coding scheme for communication over a bus by Chee et al. to control the peak temperature, the average power c…
Focal-free uniform hypergraphs and codes
Xinqi Huang, Chong Shangguan, Xiande Zhang +1
Motivated by the study of a variant of sunflowers, Alon and Holzman recently introduced focal-free hypergraphs. In this paper, we show that there is an interesting connection betwe…