The Network Coding and Reliable Communications Group, Professor Muriel Medard

Publications: Papers: 2017

  1. Unified Capacity Limit of Non-Coherent Wideband Fading Channels

    F. Gómez-Cuba, Du, J., Médard, M., and Erkip, E

    IEEE Transactions on Wireless Communications, Vol. 16, No. 1, Jan. 2017, pp. 43-57

  2. A Random Linear Network Coding Accelerator in a 2.4GHz Transmitter for IoT Applications

    G. Angelopoulos, Paidimarri, A., Chandrakasan, A., and Médard, M.

    IEEE Transactions on Circuits and Systems, Vol. 16, No. 2, Feb. 2017, pp. 694-704

  3. Diversity Coding in Two-Connected Networks

    P. Babarczi, Tapolcai, J., Pasic, A., Ronyai, L., Bérczi-Kovács, E., and Médard, M.

    IEEE/ACM Transactions on Networking, Vo. 25, No. 4, Apr. 2017, pp. 2308-2319

  4. Linear network coding and parallel transmission increase fault tolerance and optical reach

    X. Chen, Engelmann, A., Jukan, A., Médard, M.

    EEE/OSA Journal of Optical Communication and Networking, Vol. 9, No. 4, Apr. 2017, pp. 244 – 256

  5. Towards Interconnected Virtual Reality: Opportunities, Challenges and Enablers

    E. Bastug, Bennis, M., Médard, M., and Debbah, M.

    IEEE Communications Magazine, Vol. 55, No. 6, Jun. 2017, pp. 110 – 117

  6. Network Maximal Correlation

    S. Feizi, Makhdoumi, A., Kellis, M., Duffy, K., and Médard, M.

    IEEE Transactions on Network Science, Vol. 4, No. 4, Jun. 2017, pp. 2327-4697

  7. Design of FEC for Low Delay in 5G

    M. Karzand, Leith, D., Cloud, J., and Médard, M.

    IEEE Journal of Selected Areas in Communication, Vol. 35, No. 8, Aug. 2017, pp. 1783- 1793

  8. Principal Inertia Components and Applications

    F. du Pin Calmon, Makhdoumi, M., Médard, M., Varya,. M., Christiansen, M., and Duffy, K.

    IEEE Transactions on Information Theory, Vol. 63, No. 8, Aug. 2017, pp. 5011 - 5038

  9. File Updates Under Random/Arbitrary Insertions and Deletions

    Q. Wang, Jaggi, S., Médard, M., Cadambe, V. R., and Schwartz, M.

    IEEE Transactions on Information Theory, Vol. 63, No. 10, Oct. 2017, pp. 6487 – 6513

  10. Feedback-Based Online Network Coding

    Sundararajan, J.-K., Shah, D., Médard, M., and Sadeghi, P.

    IEEE Transactions on Information Theory, Vol. 63, No. 10, Oct. 2017, pp. 6628 -6649

  11. A Linear Network Code Construction for General Integer Connections Based on the Constraint Satisfaction Problem

    Y. Cui, Médard, M., Yeh, E., Leith, D., Lai, F., and Duffy, K.

    IEEE/ACM Transactions on Networking, Oct. 2017, pp. 1-14

  12. Topologies for the Provision of Network-Coded Services via Shared Satellite Channels

    U. Speidel, Cocker, ‘E., Médard, M., Heide, J., amd Vingelmann, P.

    SPACOMM 2017

  13. On Network Coded Filesystem Shim: Over-the-top Multipath Multi-Source Made Easy

    C. SØrensen, Lucani, D., and Médard, M.

    ICC 2017

  14. Capacity of Molecular Channels with Imperfect Particle-Intensity Modulation and Detection

    N. Farsad, Rose, C., Médard, M., and Goldsmith, A.

    ISIT 2017

  15. Gaussian ISI Channels with Mismatch

    W. Huleihel, Salamatian, S., Merhav, N., and Médard, M.

    ISIT 2017

  16. Centralized vs Decentralized Multi-Agent Guesswork

    S. Salamatian, Beirami, A., Cohen, A., and Médard, M.

    ISIT 2017

  17. Individually-Secure Multi-Source Multicast

    A. Cohen, Cohen, A., Gurewitz, O., and Médard, M.

    ISIT 2017

  18. Guessing With Limited Memory

    W. Huleihel, Salamatian, S., and Médard, M.

    ISIT 2017

  19. A Layered Architecture for Erasure-Coded Consistent Distributed Storage

    K. Konwar, Narayana Moorthy, P., Lynch, P. and and Médard, M.

    PODC 2017

  20. The Storage vs Repair Bandwidth Trade-off for Multiple Failures in Clustered Storage Networks

    A. Abdrashitov, Prakash, N., and Médard, M.

    ITW 2017

  21. Privacy Through Familiarity

    W. Huleheil, and Médard, M.

    ITW 2017

  22. Guesswork Subject to a Total Entropy Budget

    A. Rezaee, Beirami, A., Médard, M., Duffy, K., Makhdoumi, A.

    Allerton 2017

  23. Scheduling Wireless Ad Hoc Networks in Polynomial Time, Using Claw-free Conflict Graphs

    A. Kose, and Médard, M.

    PIMRC 2017