Multicasting algorithms for deterministic networks

@article{Ebrahimi2010MulticastingAF,
  title={Multicasting algorithms for deterministic networks},
  author={Javad B. Ebrahimi and C. Fragouli},
  journal={2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo)},
  year={2010},
  pages={1-5}
}
  • Javad B. Ebrahimi, C. Fragouli
  • Published 2010
  • Computer Science
  • 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo)
  • We present a polynomial time algorithm for multicasting rate h to N receivers over deterministic networks. Our algorithm requires intermediate network nodes to perform coding operations over vectors of a finite length L, through multiplication with L × L binary coding matrices that play the same role as coding coefficients over graphs. Our code design consists in selecting these matrices so that each receiver is able to recover the source information. As a special case, we provide an… CONTINUE READING
    Algebraic Algorithms for Vector Network Coding
    • 50
    • Open Access
    Network Coding Theory: A Survey
    • 107
    • Open Access
    Combinatiorial algorithms for wireless information flow
    • 56
    • Open Access
    Vector network coding algorithms
    • 15
    • Open Access
    Network Coding: Beyond Throughput Benefits
    • 22
    • Open Access
    Deterministic Network Model Revisited: An Algebraic Network Coding Approach
    • 17
    • Open Access
    Coding for linear operator channels over finite fields
    • 24
    • Open Access
    Coding for the deterministic network model
    • 12
    • Open Access
    (Secure) Linear network coding multicast
    • 17
    Properties of network polynomials
    • 7
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 24 REFERENCES
    Network information flow
    • 7,970
    • Open Access
    Polynomial time algorithms for multicast network code construction
    • 951
    • Open Access
    An algebraic approach to network coding
    • 1,614
    • Open Access
    Deterministic network coding by matrix completion
    • 148
    • Open Access
    Beyond routing: an algebraic approach to network coding
    • 219
    • Open Access
    Wireless Network Information Flow
    • 148
    • Open Access
    Fast Probabilistic Algorithms for Verification of Polynomial Identities
    • 1,533
    • Open Access
    Network Coding Fundamentals
    • 345
    • Open Access
    A Deterministic Approach to Wireless Relay Networks
    • 248
    • Open Access
    Approximate capacity of Gaussian relay networks
    • 98
    • Open Access