1 citations · 2 across the 2 of their papers we have counts for
3 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…
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…
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…