16 citations · 18 across the 6 of their papers we have counts for
6 papers
Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands
Seyed Ali Saberali, Lutz Lampe, Ian Blake
We investigate the problem of coded caching for nonuniform demands when the structured clique cover algorithm proposed by Maddah-Ali and Niesen for decentralized caching is used fo…
Decentralized Coded Caching Without File Splitting
Seyed Ali Saberali, Lutz Lampe, Ian Blake
Coded caching is an effective technique to reduce the redundant traffic in wireless networks. The existing coded caching schemes require the splitting of files into a possibly larg…
Adaptive Delivery in Caching Networks
Seyed Ali Saberali, Hamidreza Ebrahimzadeh Saffar, Lutz Lampe +1
The problem of content delivery in caching networks is investigated for scenarios where multiple users request identical files. Redundant user demands are likely when the file popu…
On short cycle enumeration in biregular bipartite graphs
Ian Blake, Shu Lin
A number of recent works have used a variety of combinatorial constructions to derive Tanner graphs for LDPC codes and some of these have been shown to perform well in terms of the…
New Classes of Partial Geometries and Their Associated LDPC Codes
Qiuju Diao, Juane Li, Shu Lin +1
The use of partial geometries to construct parity-check matrices for LDPC codes has resulted in the design of successful codes with a probability of error close to the Shannon capa…
A note on diagonal and Hermitian surfaces
Ian Blake, V. Kumar Murty, Hamid Usefi
Aspects of the properties, enumeration and construction of points on diagonal and Hermitian surfaces have been considered extensively in the literature and are further considered h…