Zobrazeno 1 - 10
of 158
pro vyhledávání: '"Alex Sprintson"'
Publikováno v:
IEEE Canadian Journal of Electrical and Computer Engineering. 46:77-89
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d42d702d3844d67ba80bc5c0f316bd9f
https://doi.org/10.1109/icjece.2022.3210237
https://doi.org/10.1109/icjece.2022.3210237
Publikováno v:
Allerton
We study the relation between latency and alphabet size in the context of Multicast Network Coding. Given a graph $G =$ (${V}$, E) representing a communication network, a subset $S \subseteq V$ of sources, each of which initially holds a set of infor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::597c918ad95c29aca8a361599fc4e1fd
https://doi.org/10.1109/tit.2022.3160398
https://doi.org/10.1109/tit.2022.3160398
Publikováno v:
ACM Transactions on Architecture and Code Optimization. 19:1-20
Packet classification methods rely upon matching packet content/header against pre-defined rules, which are generated by network applications and their configurations. With the rapid development of network technology and the fast-growing network appl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87bb43fa268329b03e6e573ceb696055
https://doi.org/10.1145/3514246
https://doi.org/10.1145/3514246
Publikováno v:
IEEE Transactions on Communications. 69:3898-3910
The paper presents techniques for analyzing the expected download time in distributed storage systems that employ systematic availability codes. These codes provide access to hot data through the systematic server containing the object and multiple r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3575883cf9a825124bc6e1bdabafdbb9
https://doi.org/10.1109/tcomm.2021.3067054
https://doi.org/10.1109/tcomm.2021.3067054
In recent years, the Multi-message Private Information Retrieval (MPIR) problem has received significant attention from the research community. In this problem, a user wants to privately retrieve $D$ messages out of $K$ messages whose identical copie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd48a8616334fe2d7450cb4e84076e9e
http://arxiv.org/abs/2208.13237
http://arxiv.org/abs/2208.13237
Publikováno v:
IEEE Transactions on Communications. 69:2176-2190
The index coding problem includes a server, a group of clients, and a set of data chunks. While each client wants a subset of the data chunks and already has another subset as its side information, the server transmits some uncoded data chunks or cod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a39d8daa516d8071d327dde239c24ad7
https://doi.org/10.1109/tcomm.2021.3049123
https://doi.org/10.1109/tcomm.2021.3049123
Publikováno v:
IEEE Journal on Selected Areas in Information Theory. 2:391-402
The Private Information Retrieval (PIR) problem has recently attracted a significant interest in the information-theory community. In this problem, a client wants to download one or more messages belonging to a database while protecting the identity
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8266cb996c8d3b0f8edc99c4add9c2e
https://doi.org/10.1109/jsait.2021.3053579
https://doi.org/10.1109/jsait.2021.3053579
Publikováno v:
IEEE Transactions on Information Theory. 66:6809-6822
We design $p$ - reconstructible $\mu $ - secure $[n,k]$ erasure coding schemes $(0 \leq \mu , which encode $k-\mu $ information symbols into $n$ coded symbols and moreover, satisfy the $k$ -out-of- $n$ property and the following two properties: (P1)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16d5c36aa66a39ab66f8e5e31c6d654e
https://doi.org/10.1109/tit.2020.2988868
https://doi.org/10.1109/tit.2020.2988868
Group testing has recently attracted significant attention from the research community due to its applications in diagnostic virology. An instance of the group testing problem includes a ground set of individuals which includes a small subset of infe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa3310e3cb6837ef6ad476aa586ce446
http://arxiv.org/abs/2202.12284
http://arxiv.org/abs/2202.12284
Group testing is one of the fundamental problems in coding theory and combinatorics in which one is to identify a subset of contaminated items from a given ground set. There has been renewed interest in group testing recently due to its applications
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ba1b76a1bf0a527ed1894fad83bb0ca