Wan, Kai, Tuninetti, Daniela, Ji, Mingyue, and Piantanida, Pablo. Combination Networks With End-User-Caches: Novel Achievable and Converse Bounds Under Uncoded Cache Placement. Retrieved from https://par.nsf.gov/biblio/10380662. IEEE Transactions on Information Theory 68.2 Web. doi:10.1109/TIT.2021.3127905.

Wan, Kai, Tuninetti, Daniela, Ji, Mingyue, & Piantanida, Pablo. Combination Networks With End-User-Caches: Novel Achievable and Converse Bounds Under Uncoded Cache Placement. IEEE Transactions on Information Theory, 68 (2). Retrieved from https://par.nsf.gov/biblio/10380662. https://doi.org/10.1109/TIT.2021.3127905

Wan, Kai, Tuninetti, Daniela, Ji, Mingyue, and Piantanida, Pablo. "Combination Networks With End-User-Caches: Novel Achievable and Converse Bounds Under Uncoded Cache Placement". IEEE Transactions on Information Theory 68 (2). Country unknown/Code not available. https://doi.org/10.1109/TIT.2021.3127905. https://par.nsf.gov/biblio/10380662.

@article{osti_10380662,
place = {Country unknown/Code not available}, title = {Combination Networks With End-User-Caches: Novel Achievable and Converse Bounds Under Uncoded Cache Placement}, url = {https://par.nsf.gov/biblio/10380662}, DOI = {10.1109/TIT.2021.3127905}, abstractNote = {}, journal = {IEEE Transactions on Information Theory}, volume = {68}, number = {2}, author = {Wan, Kai and Tuninetti, Daniela and Ji, Mingyue and Piantanida, Pablo}, }