20 citations · 55 across the 17 of their papers we have counts for
13 papers · 1 filter
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 d…
Capacity-Achieving Private Information Retrieval Schemes from Uncoded Storage Constrained Servers with Low Sub-packetization
Jinbao Zhu, Qifa Yan, Xiaohu Tang +1
This paper investigates reducing sub-packetization of capacity-achieving schemes for uncoded Storage Constrained Private Information Retrieval (SC-PIR) systems. In the SC-PIR syste…
Optimal Locally Repairable Codes: An Improved Bound and Constructions
Han Cai, Cuiling Fan, Ying Miao +2
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinat…
A Construction of Maximally Recoverable Codes with Order-Optimal Field Size
Han Cai, Ying Miao, Moshe Schwartz +1
We construct maximally recoverable codes (corresponding to partial MDS codes) which are based on linearized Reed-Solomon codes. The new codes have a smaller field size requirement…
Probabilistic Existence Results for Parent-Identifying Schemes
Yujie Gu, Minquan Cheng, Grigory Kabatiansky +1
Parent-identifying schemes provide a way to identify causes from effects for some information systems such as digital fingerprinting and group testing. In this paper, we consider c…
Signature codes for weighted binary adder channel and multimedia fingerprinting
Jinping Fan, Yujie Gu, Masahiro Hachimori +1
In this paper, we study the signature codes for weighted binary adder channel (WbAC) and collusion-resistant multimedia fingerprinting. Let denote the maximum cardinality…
On Optimal Locally Repairable Codes with Super-Linear Length
Han Cai, Ying Miao, Moshe Schwartz +1
Locally repairable codes which are optimal with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. T…
Bounds on Traceability Schemes
Yujie Gu, Ying Miao
The Stinson-Wei traceability scheme (known as traceability scheme) was proposed for broadcast encryption as a generalization of the Chor-Fiat-Naor traceability scheme (known as tra…
Bounds and Constructions for -Separable Codes with Length
Minquan Cheng, Jing Jiang, Haiyan Li +2
Separable codes were introduced to provide protection against illegal redistribution of copyrighted multimedia material. Let be a code of length over an alphabet…
Strongly Separable Codes
Jing Jiang, Minquan Cheng, Ying Miao
Binary -frameproof codes (-FPCs) are used in multimedia fingerprinting schemes where the identification of authorized users taking part in the averaging collusion attack is r…
Multimedia IPP Codes with Efficient Tracing
Jing Jiang, Minquan Cheng, Ying Miao +1
Binary multimedia identifiable parent property codes (binary -MIPPCs) are used in multimedia fingerprinting schemes where the identification of users taking part in the averagin…
Codes with the Identifiable Parent Property for Multimedia Fingerprinting
Minquan Cheng, Hung-Lin Fu, Jing Jiang +2
Let be a -ary code of length and size , and be the s…
New Bounds For Frameproof Codes
Chong Shangguan, Xin Wang, Gennian Ge +1
Frameproof codes are used to fingerprint digital data. It can prevent copyrighted materials from unauthorized use. In this paper, we study upper and lower bounds for -frameproof…