activity
20142026
most citedCentralized coded caching schemes: A hypergraph theoretical approach

12 citations · 43 across the 16 of their papers we have counts for

collaborators
Showing 2016Show all

6 papers · 1 filter

math.CO2016★ 2 cited

Maximum subsets of containing no right angles

Gennian Ge, Chong Shangguan

Recently, Croot, Lev, and Pach (Ann. of Math., 185:331--337, 2017.) and Ellenberg and Gijswijt (Ann. of Math., 185:339--443, 2017.) developed a new polynomial method and used it to…

cs.IT2016★ 4 cited

A New Piggybacking Design for Systematic MDS Storage Codes

Chong Shangguan, Gennian Ge

Distributed storage codes have important applications in the design of modern storage systems. In a distributed storage system, every storage node has a probability to fail and onc…

cs.IT2016★ 2 cited

New results for traitor tracing schemes

Chong Shangguan, Jingxue Ma, Gennian Ge

In the last two decades, several classes of codes are introduced to protect the copyrighted digital data. They have important applications in the scenarios like digital fingerprint…

cs.IT2016★ 12 cited

Centralized coded caching schemes: A hypergraph theoretical approach

Chong Shangguan, Yiwei Zhang, Gennian Ge

The centralized coded caching scheme is a technique proposed by Maddah-Ali and Niesen as a solution to reduce the network burden in peak times in a wireless system. Later Yan et al…

cs.IT2016

Good traceability codes do exist

Gennian Ge, Chong Shangguan

Traceability codes are combinatorial objects introduced by Chor, Fiat and Naor in 1994 to be used to trace the origin of digital content in traitor tracing schemes. Let be an a…

cs.DM2016

Separating hash families: A Johnson-type bound and new constructions

Chong Shangguan, Gennian Ge

Separating hash families are useful combinatorial structures which are generalizations of many well-studied objects in combinatorics, cryptography and coding theory. In this paper,…