activity
20102023
most citedOn the Placement Delivery Array Design in Centralized Coded Caching Scheme

222 citations · 844 across the 56 of their papers we have counts for

collaborators
Showing 2016Show all

10 papers · 1 filter

cs.IT2016★ 5 cited

On the Coded Caching Delivery Design over Wireless Networks

Lei Zheng, Qifa Yan, Qingchun Chen +1

Coded caching scheme is a promising technique to migrate the network burden in peak hours, which attains more prominent gains than the uncoded caching. The coded caching scheme can…

cs.IT2016★ 4 cited

The Optimal Placement Delivery Arrays

Minquan Cheng, Jing Jiang, Qifa Yan +2

In wireless networks, coded caching is an effective technique to reduce network congestion during peak traffic times. Recently, a new concept called placement delivery array (PDA)…

cs.IT2016

An Efficient Optimal Algorithm for the Successive Minima Problem

Jinming Wen, Lanping Li, Xiaohu Tang +1

In many applications including integer-forcing linear multiple-input and multiple-output (MIMO) receiver design, one needs to solve a successive minima problem (SMP) on an -dime…

cs.IT2016★ 140 cited

Placement Delivery Array Design through Strong Edge Coloring of Bipartite Graphs

Qifa Yan, Xiaohu Tang, Qingchun Chen +1

The technique of coded caching proposed by Madddah-Ali and Niesen is a promising approach to alleviate the load of networks during busy times. Recently, placement delivery array (P…

cs.IT2016

Optimal Locally Repairable Systematic Codes Based on Packings

Han Cai, Minquan Cheng, Cuiling Fan +1

Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, we first build a bridge between locally repairable code and…

cs.IT2016★ 6 cited

On the Gap Between Decentralized and Centralized Coded Caching Schemes

Qifa Yan, Xiaohu Tang, Qingchun Chen

Caching is a promising solution to satisfy the ongoing explosive demands for multi-media traffics. Recently, Maddah-Ali and Niesen proposed both centralized and de-centralized code…

cs.IT2016★ 7 cited

Sharp Sufficient Conditions for Stable Recovery of Block Sparse Signals by Block Orthogonal Matching Pursuit

Jinming Wen, Zhengchun Zhou, Zilong Liu +2

In this paper, we use the block orthogonal matching pursuit (BOMP) algorithm to recover block sparse signals $\x$ from measurements $\y=\A\x+\v$, where $\v$ is an -bounded…

cs.IT2016

A Novel Compressive Sensing based Enhanced Multiplexing Scheme for MIMO System

Chanzi Liu, Qingchun Chen, Xiaohu Tang

A novel compressive-sensing based signal multiplexing scheme is proposed in this paper to further improve the multiplexing gain for multiple input multiple output (MIMO) system. At…

cs.IT2016★ 80 cited

A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems

Jie Li, Xiaohu Tang, Chao Tian

We propose a generic transformation that can convert any nonbinary maximum distance separable (MDS) code into another MDS code over the same field such that 1)…

cs.IT2016★ 3 cited

A Novel Sufficient Condition for Generalized Orthogonal Matching Pursuit

Jinming Wen, Zhengchun Zhou, Dongfang Li +1

Generalized orthogonal matching pursuit (gOMP), also called orthogonal multi-matching pursuit, is an extension of OMP in the sense that indices are identified per iteratio…