Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Son Hoang Dau"'
Publikováno v:
2023 Australasian Computer Science Week.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::341311f4cb62e30db2ee97f2479c678f
https://doi.org/10.1145/3579375.3579385
https://doi.org/10.1145/3579375.3579385
Publikováno v:
IEEE Transactions on Information Theory. 67:6395-6407
We propose new repair schemes for Reed-Solomon codes that use subspace polynomials and hence generalize previous works in the literature that employ trace polynomials. The Reed-Solomon codes are over $\mathbb {F}_{{q}^{\ell }}$ and have redundancy ${
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::610b8490b6c2a450ee001c6307b892db
https://doi.org/10.1109/tit.2021.3071878
https://doi.org/10.1109/tit.2021.3071878
Publikováno v:
2022 IEEE Information Theory Workshop (ITW).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56686c50719c5018a2abf110636584a1
https://doi.org/10.1109/itw54588.2022.9965852
https://doi.org/10.1109/itw54588.2022.9965852
Autor:
Son Hoang Dau, Ryan Gabrys, Yu-Chih Huang, Chen Feng, Quang-Hung Luu, Eidah Alzahrani, Zahir Tari
Publikováno v:
IEEE Transactions on Information Theory. :1-1
Distributed computing, in which a resource-intensive task is divided into subtasks and distributed among different machines, plays a key role in solving large-scale problems. Coded computing is a recently emerging paradigm where redundancy for distri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::258a926b0066532c323fa1e176319aec
https://doi.org/10.1109/tit.2023.3247860
https://doi.org/10.1109/tit.2023.3247860
Publikováno v:
IEEE/ACM Transactions on Networking. 23:1890-1902
We study the Relay-based Cooperative Data Exchange (RCDE) problem, where initially each client has access to a subset of a set of $n$ original packets, referred to as their side information, and wants to retrieve all other original packets via cooper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3226c9cce7cdb3ce39f1be46dff39a69
https://doi.org/10.1109/tnet.2014.2342739
https://doi.org/10.1109/tnet.2014.2342739
Publikováno v:
IEEE Journal on Selected Areas in Communications. 33:236-249
We investigate a simple multiple access network (SMAN) where $k$ independent sources of unit rates multicast their information to a set of sinks, via $n$ commonly shared relays. All links are assumed to have unit capacity. Given such a SMAN, a coding
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5322706956aa70e3fe816a63d319d81
https://doi.org/10.1109/jsac.2014.2384295
https://doi.org/10.1109/jsac.2014.2384295
Autor:
Son Hoang Dau, Yeow Meng Chee
Publikováno v:
Algorithmica. 71:152-180
The min-rank of a graph was introduced by Haemers (1978) to bound the Shannon capacity of a graph. This parameter of a graph has recently gained much more attention from the research community after the work of Bar-Yossef et al. (2006). In their pape
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::48a6e841d7988bc8448773c9adbfc42e
https://doi.org/10.1007/s00453-013-9789-9
https://doi.org/10.1007/s00453-013-9789-9
Autor:
Son Hoang Dau, Olgica Milenkovic
Publikováno v:
ISIT
We propose a new latent Boolean feature model for complex networks that captures different types of node interactions and network communities. The model is based on a new concept in graph theory, termed the co-intersection representation of a graph,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d64d4abd45de932f8fc3712aa9fe53d6
https://doi.org/10.1109/isit.2016.7541519
https://doi.org/10.1109/isit.2016.7541519
Publikováno v:
ITW Fall
We introduce a new family of erasure codes, called group decodable code (GDC), for distributed storage system. Given a set of design parameters {\alpha; \beta; k; t}, where k is the number of information symbols, each codeword of an (\alpha; \beta; k
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f04b91006d43fe65298dac07220dea4
https://doi.org/10.1109/itwf.2015.7360737
https://doi.org/10.1109/itwf.2015.7360737
Publikováno v:
Allerton
Vandermonde and Cauchy matrices are commonly used in the constructions of maximum distance separable (MDS) codes. However, when additional design constraints are imposed on the code construction in addition to the MDS requirement, a Vandermonde or Ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::956dcd759c7e6ad53c430d4b2d040f28
https://doi.org/10.1109/allerton.2015.7447110
https://doi.org/10.1109/allerton.2015.7447110