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

The Universal Decoder That Works in One Microsecond

Read this article from Boston University about "the first silicon chip that can decode any error-correcting code—even codes that don’t yet exist— potentially leading to faster and more efficient 5G networks and connected devices."

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

Bilkent University EEE Distinguished Seminar Series

October 12th, 2021 at 10:30am ET - Please join virtually for Professor Médard's talk "Deviation from the standard — toward opening up 5G telecommunications". Learn more at https://bit.ly/BilEEESem211012.  [pdf-embedder...

MIT CINCS / Hamilton Institute Seminar Series: Prof. Lalitha Sankar, ASU

Wednesday, October 13th at 11am ET  (4pm IST) - Professor Lalitha Sankar, ASU: "Alpha-loss: A Tunable Class of Loss Functions for Robust Learning" https://mit.zoom.us/j/93243104349 Passcode: mh-seminar Abstract: Machine learning has dramatically enhanced the role of...

The 21st IEEE ICCT Keynote: “Deviation from the standard – towards opening up communications”

Thursday, October 14th at 9pm ET -  Professor Médard will give a keynote speech at the IEEE International Conference on Communication Technology, held in a hybrid fashion, both in Tianjin, China and on Zoom (passcode required). A detailed program is available here....

IEEE 5G World Forum 2021 Keynote: “Beyond standardized codes – universal decoding through Guessing Random Additive Noise Decoding (GRAND)”

Friday, October 15th at 9am ET - Professor Médard will give a keynote speech at the IEEE 5G World Forum hybrid event. A detailed program is available here.

Dean W. Lytle Electrical & Computer Engineering Endowed Lecture Series

Monday, October 18th at 3pm ET  (12pm PT) -  Professor Médard will give the Lytle Lecture "Deviation from the standard - toward opening up 5G telecommunications" via Zoom and then a technical seminar "Guessing Random Additive Noise Decoding (GRAND)" at 5pm ET (2pm PT)...

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.

MIT CINCS / Hamilton Institute Seminar Series: Dr. Hazel Murray, MTU

Wednesday, October 6th at 11am ET  (4pm IST) Dr. Hazel Murray, MTU: "A journey in authentication security" https://mit.zoom.us/j/93243104349 Passcode: mh-seminar Abstract: Authentication is integral to our online world. We use it to secure our most important...

“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...

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...

Publications

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

RGL D’Oliveira, A Cohen, J Robinson… – arXiv preprint arXiv …, 2021 – arxiv.org
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
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 …

Managing Noise and Interference Separately-Multiple Access Channel Decoding using Soft GRAND

A Solomon, KR Duffy, M Médard – 2021 IEEE International …, 2021 – ieeexplore.ieee.org
Two main problems arise in the Multiple Access Channel (MAC): interference
from different users, and additive noise channel noise. Maximum A-Posteriori (MAP) joint
decoding or successive interference cancellation are known to be capacity-achieving for the …

NeuraCrypt: Hiding Private Health Data via Random Neural Networks for Public Training

A Yala, H Esfahanizadeh, RGLD Oliveira… – arXiv preprint arXiv …, 2021 – arxiv.org
Balancing the needs of data privacy and predictive utility is a central challenge
for machine learning in healthcare. In particular, privacy concerns have led to a dearth of
public datasets, complicated the construction of multi-hospital cohorts and limited the …
[PDF]

Bringing Network Coding into SDN: Architectural Study for Meshed Heterogeneous Communications

A Cohen, H Esfahanizadeh, B Sousa… – IEEE …, 2021 – ieeexplore.ieee.org
Modern communications have moved away from point-to-point models to
increasingly heterogeneous network models. In this article, we propose a novel controller-
based architecture to deploy adaptive causal network coding in heterogeneous and highly …

CRC Codes as Error Correction Codes

W An, M Médard, KR Duffy – arXiv preprint arXiv:2104.13663, 2021 – arxiv.org
CRC codes have long since been adopted in a vast range of applications. The
established notion that they are suitable primarily for error detection can be set aside
through use of the recently proposed Guessing Random Additive Noise Decoding (GRAND) …

15 Network Functional Compression

S Feizi, M Médard – Information-Theoretic Methods in Data …, 2021 – books.google.com
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
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
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
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
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/

Megan Su

UROP
office: 36-512
email: megansu@mit.edu

Andrea Jaba

MEng Student
office: 36-512
email: adjaba@mit.edu 
website: http://www.github.com/adjaba 

Bill Wu

MEng Student
office: 36-512
email: billwu@mit.edu 

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/

Alexander Mariona

Doctoral Student
office: 36-512
email: amariona@mit.edu 
website: https://github.com/agmariona 

Basak Ozaydin

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

Evan Gabhart

MEng Student
office: 36-512
email: egabby97@mit.edu 

Kathleen Yang

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

Teaching

Current:

6.450 – Principles of Digital Communication

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