Ying Miao

User-Irrepressible Sequences for Multiple-Packet Reception with MPR Capability 2: Constructions and Age of Information

Yen-Ling Shih, Kangkang Xu, Tsai‐Lien Wong, Yuan-Hsun Lo et autres

jp, tw, cn (code pays fourni par la source)

FRACTAL DIMENSION OF SUBSTITUTION TREE NETWORKS

Qingcheng Zeng, Daohua Wang, Ying Miao

Substitution networks can be constructed inductively based on multiple colored initial graphs. In this paper, we obtain a relationship between the row sums of power of a nonnegative matrix and its spectral radius. Furthermore, we investigate the substitution networks with colored initial …

cn, jp (code pays fourni par la source)

Existence and Algorithmic Construction of $q$-ary Secure Codes with List Decoding

Ling Li Jiang, Yujie Gu, Jinping Fan, Ying Miao

Secure codes with list decoding (SCLDs) were introduced due to their applications in collusion-resistant multimedia fingerprinting for copyright protection. A fundamental research problem is investigating the largest code rates and explicit constructions for SCLDs. So far, the largest code rates of SCLDs …

cn, jp (code pays fourni par la source)

Repairing Schemes for Tamo-Barg Codes

Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang

In this paper, the repair problem for erasures beyond locality in locally repairable codes is explored under a practical system setting, where a rack-aware storage system consists of racks, each containing a few parity checks. This is referred to as a rack-aware …

cn, jp, ca (code pays fourni par la source)

A Construction of Optimal One-Coincidence Frequency-Hopping Sequences via Generalized Cyclotomy

Minfeng Shao, Ying Miao

Frequency-hopping sequences (FHSs) with low Hamming correlation are essential for synchronization and multiple-access communication systems. In this paper, we propose a novel construction of FHSs using generalized cyclotomy. Our results reveal that the constructed FHSs exhibit a one-coincidence property, meaning that the …

cn, jp (code pays fourni par la source)

Repairing Schemes for Tamo-Barg Codes

Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang

We study the problem of repairing erasures in locally repairable codes beyond the code locality under the rack-aware model. We devise two repair schemes to reduce the repair bandwidth for Tamo-Barg codes under the rack-aware model, by setting each repair set as …

cn, jp, ca (code pays fourni par la source)

Colon-targeted hydroxyethyl starch-curcumin microspheres with high loading capacity ameliorate ulcerative colitis via alleviating oxidative stress, regulating inflammation, and modulating gut microbiota

Da Huang, Yong-ming Wang, Chenlan Xu, Minglang Zou et autres

cn (code pays fourni par la source)

Repairing Schemes for Tamo-Barg Codes

Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang

In this paper, the repair problem for erasures beyond locality in locally repairable codes is explored under a practical system setting, where a rack-aware storage system consists of racks, each containing a few parity checks. This is referred to as a rack-aware …

Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding

Marcel Fernández, Grigory A. Kabatiansky, Stanislav Kruglik, Ying Miao

We construct codes that allow to exactly recover the support of an unknown sparse vector with almost equal absolute values of all nonzero coordinates given results of linear measurements in the presence of noise with ℓp-norm bounded from above. We propose a …

es, ru, sg, jp (code pays fourni par la source)

Multimedia Fingerprinting Codes Resistant to Linear Attacks and Adversarial Noise

Marcel Fernández, Grigory A. Kabatiansky, Ibrahim Kamel, Ying Miao et autres

It has recently been shown that there are no multimedia fingerprinting codes that can find all malicious users when they use arbitrary linear attacks plus adversarial noise. It is shown that such codes exist if the complete recovery property is limited to …

es, ru, ae, jp (code pays fourni par la source)

Secure Codes With List Decoding

Yujie Gu, Ilya Vorobyev, Ying Miao

In this paper we consider combinatorial secure codes in traitor tracing for protecting copyright of multimedia content. First, we introduce a new notion of secure codes with list decoding (SCLDs) for collusion-resistant multimedia fingerprinting, which includes many existing types of fingerprinting codes …

jp, de (code pays fourni par la source)

Codes for Exact Support Recovery of Sparse Vectors from Inaccurate Linear Measurements and Their Decoding

Marcel Fernández, Grigory A. Kabatiansky, Stanislav Kruglik, Ying Miao

We construct codes that allow to exactly recover the support of an unknown sparse vector with almost equal absolute values of all nonzero coordinates given results of linear measurements in the presence of noise with $\ell_p$ -norm bounded from above. We propose …

es, ru, sg, jp (code pays fourni par la source)