Zobrazeno 1 - 10
of 289
pro vyhledávání: '"Zhou, Junling"'
Autor:
Shan, Yunjing, Zhou, Junling
There is a large literature on cover-free families of finite sets, because of their many applications in combinatorial group testing, cryptographic and communications. This work studies the generalization of cover-free families from sets to finite ve
Externí odkaz:
http://arxiv.org/abs/2407.20614
Autor:
Shan, Yunjing, Zhou, Junling
Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb{F}_{q}$, and let $\mathcal{L}(V)=\bigcup_{0\leq k\leq n}\left[V\atop k\right]$ be the set of all subspaces of $V$. A family of subspaces $\mathcal{F}\subseteq \mathcal{L}(V)$ i
Externí odkaz:
http://arxiv.org/abs/2207.06727
Autor:
Zhou, Junling, Gao, Shuilian, Du, Zhenghua, Jin, Shan, Yang, Zhenbiao, Xu, Tongda, Zheng, Chao, Liu, Ying
Publikováno v:
In Food Chemistry 1 January 2025 462
Autor:
Liu, Ruijing, Zhou, Junling
Given a set $V$ of $v$ servers along with $b$ files (data), each file is replicated (placed) on exactly $k$ servers and thus a file can be represented by a set of $k$ servers. Then we produce a data placement consisting of $b$ subsets of $V$ called b
Externí odkaz:
http://arxiv.org/abs/2109.14140
Autor:
Yan, Qianqian, Zhou, Junling
Tang and Ding [IEEE IT 67 (2021) 244-254] studied the class of narrow-sense BCH codes $\mathcal{C}_{(q,q+1,4,1)}$ and their dual codes with $q=2^m$ and established that the codewords of the minimum (or the second minimum) weight in these codes suppor
Externí odkaz:
http://arxiv.org/abs/2106.10903
Autor:
Zhao, Shanshan, Zhou, Junling, Chen, Run, Zhou, Wei, Geng, Huizhen, Huang, Yihong, Shi, Shaole, Yuan, Lemin, Wang, Zilian, Wang, Dongyu
Publikováno v:
In Cytokine April 2024 176
Publikováno v:
In Diabetes Research and Clinical Practice February 2024 208
Autor:
Etzion, Tuvi, Zhou, Junling
Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial designs with the same parameters. In particular, a large set of block designs, whose blocks
Externí odkaz:
http://arxiv.org/abs/2007.09608
In this paper we investigate combinatorial constructions for $w$-cyclic holely group divisible packings with block size three (briefly by $3$-HGDPs). For any positive integers $u,v,w$ with $u\equiv0,1~(\bmod~3)$, the exact number of base blocks of a
Externí odkaz:
http://arxiv.org/abs/2006.06921
Autor:
Zhou, Junling, Zhou, Wenling
Various kinds of fingerprinting codes and their related combinatorial structures are extensively studied for protecting copyrighted materials. This paper concentrates on one specialised fingerprinting code named wide-sense frameproof codes in order t
Externí odkaz:
http://arxiv.org/abs/2002.11266