Professor Muriel Médard

Muriel Médard is the Cecil H. Green Professor in the Electrical Engineering and Computer Science (EECS) Department at MIT and leads the Network Coding and Reliable Communications Group at the Research Laboratory for Electronics at MIT.

Full bio here

Massachusetts Institute of Technology
Research Laboratory of Electronics
Room 36-512F
77 Massachusetts Avenue
Cambridge, MA 02139
617.253.3167—Tel
617.258.7864—Fax

News & Events

GRAND: A Universal System for Decoding Any Type of Data Sent Across a Network

"A new silicon chip can decode any error-correcting code through the use of a novel algorithm known as Guessing Random Additive Noise Decoding (GRAND). This chip eliminates the need for specific decoding hardware, could boost efficiency of gaming systems, 5G networks,...

Inspiring Academic Female Founders Interview Professor Médard

Read the conversation with Professor Muriel Médard, CodeOn Cofounder, here.

Keynote Speaker at ACM MobiHoc 2021

Professor Médard will be a keynote speaker at ACM MobiHoc 2021 with her talk: "Waste not, want not - using spectrum efficiently for low delay." July 26th - July 29th, 2021 in Shanghai, China (hybrid event). For more information, please visit here.

Guest speaker at Aalto University 5G summer course

Professor Medard will be a guest speaker at Aalto University International online 5G Summer Course on June 15 9AM EDT. For more information please visit here.

IEEE MONTREAL KEYNOTE EVENT- IT’S ALL IN THE NOISE – UNIVERSAL NOISE-CENTRIC DECODING

Professor Medard will give a talk at the IEEE Montreal Keynote event on May 13 at 6PM Eastern time.  

Professor Medard has been elected to American Academy of Arts and Sciences for 2021

Professor Medard has been elected to American Academy of Arts and Sciences for 2021 [link] [link]

WCNC Keynote March 31st 11AM China Standard Time / 11PM EDT

Join Prof. Medard at the IEEE Consumer Communications & Networking Conference

“The future 6G paradigms: AI-enabled networks, cross-layering and wireless access”

September 21st, 2021 at 9am ET - Please join Prof. Médard for her talk "Learning the noise instead of designing the code" at this IEEE TCGCC and ETI-MLC Joint Seminar.   https://ucla.zoom.us/j/95275073861

UIUC C3.ai Digital Transformation Institute Workshop on Networks of Machine Learning, for Machine Learning, by Machine Learning

September 22-24, 2021 - Organized by MIT Professors Muriel Médard and Manya Ghobadi, this will be a free three-day workshop through Zoom and YouTube. Please find more information here. The main driver of new traffic in current backbones has been data shared for...

Bilkent University EEE Distinguished Seminar Series

October 12th, 2021 at 11am ET - Please join virtually for Professor Medard's talk "Deviation from the standard — toward opening up 5G telecommunications".     Much of the recent debate on the adoption of 5G wireless technology has centered on the issue of standards....

The Decade of Digital Inclusion: Building Inclusion into Digital Technology R&D

October 22nd, 2021 at 9:55am ET - Professor Médard will take part in a panel discussion at the Marconi Society's Decade of Digital Inclusion Symposium.

Panel at the Decade of Digital Inclusion: The Issues That Keep Us Up At Night

September 15th, 2021 at 11am ET - Please join Professor Médard for this panel discussion which will set the stage for the Marconi Society's Master Class and Symposium, The Decade of Digital Inclusion. They will "touch on the socio-economic issues of getting the right...

MIT-Harvard CINCS / Hamilton Institute Seminar – Alejandro Ribeiro

MIT-Harvard Communications Information Networks Circuits and Signals (CINCS) / Hamilton Institute Seminar Date: May 19, 2021 Time: 10AM EDT Zoom: https://mit.zoom.us/j/94416668228?pwd=LzJCV1VveUZ6WHdkQnlwektrVVkwQT09 Passcode: 825980   Speaker: Prof. Alejandro...

MIT-Harvard CINCS / Hamilton Institute Seminar – Katie Wilson

MIT-Harvard Communications Information Networks Circuits and Signals (CINCS) / Hamilton Institute Seminar Date: May 26, 2021 Time: 10AM EDT   Zoom: https://mit.zoom.us/j/94416668228?pwd=LzJCV1VveUZ6WHdkQnlwektrVVkwQT09 Passcode: 825980   Title: "Sometimes...

MIT-Harvard Communications Information Networks Circuits and Signals (CINCS) / Hamilton Institute Seminar – Professor Edward Curry

MIT-Harvard Communications Information Networks Circuits and Signals (CINCS) / Hamilton Institute Seminar   Date: May 12, 2021 Time: 10AM EDT   Zoom: https://mit.zoom.us/j/94416668228?pwd=LzJCV1VveUZ6WHdkQnlwektrVVkwQT09 Passcode: 825980   Title: From...

MIT-Harvard Communications Information Networks Circuits and Signals (CINCS) / Hamilton Institute Seminar – Simon Cotton

MIT-Harvard Communications Information Networks Circuits and Signals (CINCS) / Hamilton Institute Seminar   Date: May 5, 2021 Time: 10AM EDT   Zoom: https://mit.zoom.us/j/94416668228?pwd=LzJCV1VveUZ6WHdkQnlwektrVVkwQT09 Passcode: 825980  ...

MIT-Harvard CINCS / Hamilton Institute seminar – Ayalvadi Ganesh

MIT-Harvard CINCS / Hamilton Institute seminar   Date: April 28, 2021 Time: 10AM EST   Zoom: https://mit.zoom.us/j/94416668228?pwd=LzJCV1VveUZ6WHdkQnlwektrVVkwQT09 Password: 825980 Speaker: Ayalvadi Ganesh Title: Broadcasting in random graphs   Abstract:...

Publications

Post-Quantum Security for Ultra-Reliable Low-Latency Heterogeneous Networks

RGL D’Oliveira, A Cohen, J Robinson… – arXiv preprint arXiv …, 2021 – arxiv.org
13 days ago – We consider the problem of post-quantum secure and ultra-reliable
communication through a heterogeneous network consisting of multiple connections. Three
performance metrics are considered: security, throughput, and in-order delivery delay. In this …

Degree tables for secure distributed matrix multiplication

RGL D’Oliveira, S El Rouayheb… – IEEE Journal on …, 2021 – ieeexplore.ieee.org
We consider the problem of secure distributed matrix multiplication (SDMM) in which a user
wishes to compute the product of two matrices with the assistance of honest but curious
servers. We construct polynomial codes for SDMM by studying a recently introduced
combinatorial tool called the degree table.  

Graph-Theoretical Dynamic User Pairing for Downlink NOMA Systems

A Köse, M Koca, E Anarım, M Médard… – IEEE …, 2021 – ieeexplore.ieee.org
9 days ago – We propose a novel graph-theoretical dynamic user pairing strategy based on
the user rate requirements in cellular networks employing non-orthogonal multiple access
(NOMA). The proposed approach relies on first constructing a conflict graph corresponding …

15 Network Functional Compression

S Feizi, M Médard – Information-Theoretic Methods in Data …, 2021 – books.google.com
4 days ago – In this chapter, 1 we study the problem of compressing for function
computation across a network from an information-theoretic point of view. We refer to this
problem as network functional compression. In network functional compression, computation …

Stream Distributed Coded Computing

A Cohen, G Thiran, H Esfahanizadeh… – arXiv preprint arXiv …, 2021 – arxiv.org
6 days ago – The emerging large-scale and data-hungry algorithms require the
computations to be delegated from a central server to several worker nodes. One major
challenge in the distributed computations is to tackle delays and failures caused by the …

Differential Privacy for Binary Functions via Randomized Graph Colorings

RGL D’Oliveira, M Médard, P Sadeghi – arXiv preprint arXiv:2102.05172, 2021 – arxiv.org
27 days ago – We present a framework for designing differentially private (DP) mechanisms
for binary functions via a graph representation of datasets. Datasets are nodes in the graph
and any two neighboring datasets are connected by an edge. The true binary function we …

Spatial Concentration of Caching in Wireless Heterogeneous Networks

D Malak, M Médard, JG Andrews – IEEE Transactions on …, 2021 – ieeexplore.ieee.org
53 days ago – We propose a decentralized caching policy for wireless heterogeneous
networks that makes content placement decisions based on pairwise interactions between
cache nodes. We call our proposed scheme γ-exclusion cache placement (GEC), where a …

Robust Improvement of the Age of Information by Adaptive Packet Coding

M CostaY SagduyuT ErpekM Médard – arXiv preprint arXiv:2012.05172, 2020 – arxiv.org
26 days ago – We consider a wireless communication network with an adaptive scheme to
select the number of packets to be admitted and encoded for each transmission, and
characterize the information timeliness. For a network of erasure channels and discrete time …

People

Wei An

Doctoral Student
office: 36-512A
email: wei_an@mit.edu

Benoit Pit-Claudel

Doctoral Student
office: 36-512
email: bpitcla@mit.edu
website: https://pit-claudel.fr/benoit/

Alejandro Cohen

Postdoctoral Associate
office: 36-512N
email: cohenale@MIT.EDU
website: https://sites.google.com/view/alejandrocohen/home

Rafael G. L. D'Oliveira

Postdoctoral Associate
office: 36-512Q
Email: rafaeld@mit.edu
website: http://www.mit.edu/~rafaeld/

Homa Esfahanizadeh

Postdoctoral Associate
office: 36-512L
email: homaesf@MIT.EDU
website: https://homaesfahanizadeh.com/

Litian Liu

Doctoral Student
office: 36-512
email: litianl@mit.edu
website: https://sites.google.com/view/litianliu

Basak Ozaydin

Doctoral Student
office: 36-512
email: bozaydin@mit.edu
website: https://sites.google.com/view/basakozaydin/home

Amit Solomon

Doctoral Student
office: 36-512A
email: amitsol@mit.edu
website: https://sites.google.com/view/amitsolomon/home

Kathleen Yang

Doctoral Student
office: 36-512A
email:klyang@MIT.EDU
website: ktljyang.github.io

Teaching

Current:

6.036 – Introduction to Machine Learning

6.006 – Introduction to Algorithms

6.02 – Introduction to EECS via Communication Networks

6.033 – Computer Systems Engineering

6.S076 – Special Subject in Electrical Engineering and Computer Science

Contact

Massachusetts Institute of Technology
Research Laboratory of Electronics
Room 36-512F
77 Massachusetts Avenue
Cambridge, MA 02139

617.253.3167—Tel
617.258.7864—Fax

 

Drew Houser
Administrative Assistant
Room 36-512C
617.253.6171