Polynomial Time Algorithms for Multicast Network Code Construction

IEEE Transactions on Information Theory - United States
doi 10.1109/tit.2005.847712
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Distributed Algorithms for Minimum Cost Multicast With Network Coding

IEEE/ACM Transactions on Networking
Electronic EngineeringComputer NetworksCommunicationsComputer Science ApplicationsElectricalSoftware
2010English

Polynomial Time Algorithms for Scheduling of Arrival Aircraft

2005English

Multiple Multicast Tree Construction and Multiple Description Video Assignment Algorithms

2011English

Polynomial Algorithms for Perfect Graphs

North-Holland Mathematics Studies
1984English

Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks

1995English

Polynomial Algorithms for Linear Programming

Lecture Notes in Economics and Mathematical Systems
MathematicsEconomicsEconometricsFinance
1988English

A Combinatorial Construction of High Order Algorithms for Finding Polynomial Roots of Known Multiplicity

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
2010English

New Algorithms for Delay-Constrained Multicast Routing

2002English

A Polynomial Time Attack Against Algebraic Geometry Code Based Public Key Cryptosystems

2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy