Bounds on the Minimum Field Size of Network MDS Codes
H Wei, M Schwartz - IEEE Transactions on Information Theory, 2024 - ieeexplore.ieee.org
We study network maximum distance separable (MDS) codes, which are a class of network
error-correcting codes whose distance attains the Singleton-type bound. The minimum field …
error-correcting codes whose distance attains the Singleton-type bound. The minimum field …
Capacity results for multicasting nested message sets over combination networks
SS Bidokhti, VM Prabhakaran… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
The problem of multicasting two nested messages is studied over a class of networks known
as combination networks. A source multicasts two messages, a common and a private …
as combination networks. A source multicasts two messages, a common and a private …
Network-coding solutions for minimal combination networks and their sub-networks
Minimal multicast networks are fascinating and efficient combinatorial objects, where the
removal of a single link makes it impossible for all receivers to obtain all messages. We …
removal of a single link makes it impossible for all receivers to obtain all messages. We …
Feedback-based coding algorithms for broadcast erasure channels with degraded message sets
M Gatzianas, SS Bidokhti… - … Symposium on Network …, 2012 - ieeexplore.ieee.org
We consider single-hop broadcast packet erasure channels (BPEC) with degraded
message sets and instantaneous feedback regularly available from all receivers, and …
message sets and instantaneous feedback regularly available from all receivers, and …
On the gap between scalar and vector solutions of generalized combination networks
We study scalar-linear and vector-linear solutions of the generalized combination network.
We derive new upper and lower bounds on the maximum number of nodes in the middle …
We derive new upper and lower bounds on the maximum number of nodes in the middle …
On multicasting nested message sets over combination networks
SS Bidokhti, VM Prabhakaran… - 2012 IEEE Information …, 2012 - ieeexplore.ieee.org
In this paper, we study delivery of two nested message sets over combination networks with
an arbitrary number of receivers, where a subset of receivers (public receivers) demand only …
an arbitrary number of receivers, where a subset of receivers (public receivers) demand only …
Joint routing and random network coding for multi-session networks
A joint routing and random network coding approach is introduced for the multi-session
networks. With the proposed approach, part of the information is transmitted using routing, to …
networks. With the proposed approach, part of the information is transmitted using routing, to …
[PDF][PDF] A class of feedback-based coding algorithms for broadcast erasure channels with degraded message sets
We consider single-hop broadcast erasure channels (BEC) with degraded message sets
and instantaneous feedback regularly available from all receivers, and demonstrate that the …
and instantaneous feedback regularly available from all receivers, and demonstrate that the …
Degraded two-message multicast over graphs
SS Bidokhti, C Fragouli - 2011 IEEE International Symposium …, 2011 - ieeexplore.ieee.org
We consider communication of two degraded message sets over graphs where a common
source sends two prioritized messages (a common and a private message) to several …
source sends two prioritized messages (a common and a private message) to several …
A class of feedback-based coding algorithms for broadcast erasure channels with degraded message sets
We consider single-hop broadcast erasure channels (BEC) with degraded message sets
and instantaneous feedback regularly available from all receivers, and demonstrate that the …
and instantaneous feedback regularly available from all receivers, and demonstrate that the …