21 citations · 58 across the 11 of their papers we have counts for
7 papers · 1 filter
New constant-dimension subspace codes from parallel cosets of optimal Ferrers diagram rank-metric codes and multilevel inserting constructions
Gang Wang, Hong-Yang Yao, Fang-Wei Fu
Constant-dimension subspace codes (CDCs), a special class of subspace codes, have attracted significant attention due to their applications in network coding. A fundamental researc…
Distributed Reed-Solomon Codes for Simple Multiple Access Networks
Wael Halbawi, Tracey Ho, Hongyi Yao +1
We consider a simple multiple access network in which a destination node receives information from multiple sources via a set of relay nodes. Each relay node has access to a subset…
Rateless Resilient Network Coding Against Byzantine Adversaries
Wentao Huang, Tracey Ho, Hongyi Yao +1
This paper considers rateless network error correction codes for reliable multicast in the presence of adversarial errors. Most existing network error correction codes are designed…
Network Equivalence in the Presence of an Eavesdropper
Theodoros K. Dikaliotis, Hongyi Yao, Tracey Ho +2
We consider networks of noisy degraded wiretap channels in the presence of an eavesdropper. For the case where the eavesdropper can wiretap at most one channel at a time, we show t…
Low-Complexity Near-Optimal Codes for Gaussian Relay Networks
Theodoros K. Dikaliotis, Hongyi Yao, Salman Avestimehr +2
We consider the problem of information flow over Gaussian relay networks. Similar to the recent work by Avestimehr \emph{et al.} [1], we propose network codes that achieve up to a…
Multiple-access Network Information-flow and Correction Codes
Theodoros K. Dikaliotis, Tracey Ho, Sidharth Jaggi +5
This work considers the multiple-access multicast error-correction scenario over a packetized network with malicious edge adversaries. The network has min-cut and packets o…