Muriel Medard

Muriel Medard

Auto-generated profile, based on publicly available information

Muriel Medard

Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 August 2022 in IEEE Transactions on Signal Processing
Verified
Journal Article
Open access
KDKen R. Duffy
Ken R. Duffy
WAWei An
Wei An
MMMuriel Medard
Muriel Medard
Error correction techniques traditionally focus on the co-design of restricted code-structures in tandem with code-specific decoders that are computationally efficient when decoding long codes in hardware. Modern applications are, however, driving demand for ultra-reliable low-latency communications (URLLC), rekindling interest in the performance of shorter, higher-rate error correcting codes, and raising the possibility of revisiting universal, code-agnostic decoders. To that end, here we introduce a soft-detection variant of Guessing Random Additive Noise Decoding (GRAND) called Ordered Reliability Bits GRAND that can accurately decode any moderate redundancy block-code. It is designed with efficient circuit implementation in mind, and determines accurate decodings while retaining the original hard detection GRAND algorithm's suitability for a highly parallelized implementation in hardware. ORBGRAND is shown to provide excellent soft decision block error performance for codes of distinct classes (BCH, CA-Polar and RLC) with modest complexity, while providing better block error rate performance than CA-SCL, a state of the art soft detection CA-Polar decoder. ORBGRAND offers the possibility of an accurate, energy efficient soft detection decoder suitable for delivering URLLC in a single hardware realization.

1 June 2007
Verified
Conference Paper
Closed access
FZFang Zhao
Fang Zhao
TKTon Kalker
Ton Kalker
MMMuriel Medard
Muriel Medard
KHKeesook J. Han
Keesook J. Han
Recent research has shown that network coding can be used in content distribution systems to improve the speed of downloads and the robustness of the systems. However, such systems are very vulnerable to attacks by malicious nodes, and we need to have a signature scheme that allows nodes to check the validity of a packet without decoding. In this paper, we propose such a signature scheme for network coding. Our scheme makes use of the linearity property of the packets in a coded system, and allows nodes to check the integrity of the packets received easily. We show that the proposed scheme is secure, and its overhead is negligible for large files.

1 March 2006
Verified
Conference Paper
Closed access
AEAtilla Eryilmaz
Atilla Eryilmaz
AOAsuman Ozdaglar
Asuman Ozdaglar
MMMuriel Medard
Muriel Medard
This paper analyzes the gains in delay performance resulting from network coding. We consider a model of file transmission to multiple receivers from a single base station. Using this model, we show that gains in delay performance from network coding with or without channel side information can be substantial compared to conventional scheduling methods for downlink transmission.

1 July 2006
Verified
Conference Paper
Closed access
DTDanail Traskov
Danail Traskov
NRNiranjan Ratnakar
Niranjan Ratnakar
DLDesmond S. Lun
Desmond S. Lun
RKRalf Koetter
Ralf Koetter
MMMuriel Medard
Muriel Medard
In this paper we consider the application of network coding to a multiple unicast setup. We present two suboptimal, yet practical code construction techniques. One consists of a linear program and the other of an integer program with fewer variables and constraints. We discuss the performance of the proposed techniques as well as their complexity

20 September 2021 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
KDKen R. Duffy
Ken R. Duffy
MMMuriel Medard
Muriel Medard
WAWei An
Wei An
The design and implementation of error correcting codes has long been informed by two fundamental results: Shannon’s 1948 capacity theorem, which established that long codes use noisy channels most efficiently; and Berlekamp, McEliece, and Van Tilborg’s 1978 theorem on the NP-completeness of decoding linear codes. These results shifted focus away from creating code-independent decoders, but recent low-latency communication applications necessitate relatively short codes, providing motivation to reconsider the development of universal decoders. We introduce a scheme for employing binarized symbol soft information within Guessing Random Additive Noise Decoding, a universal hard detection decoder. We incorporate codebook-independent quantization of soft information to indicate demodulated symbols to be reliable or unreliable. We introduce two decoding algorithms: one identifies a conditional Maximum Likelihood (ML) decoding; the other either reports a conditional ML decoding or an error. For random codebooks, we present error exponents and asymptotic complexity, and show benefits over hard detection. As empirical illustrations, we compare performance with majority logic decoding of Reed-Muller codes, with Berlekamp-Massey decoding of Bose-Chaudhuri-Hocquenghem codes, with CA-SCL decoding of CA-Polar codes, and establish the performance of Random Linear Codes, which require a universal decoder and offer a broader palette of code sizes and rates than traditional codes.

1 June 2007
Verified
Conference Paper
Closed access
LLLuisa Lima
Luisa Lima
MMMuriel Medard
Muriel Medard
JBJoao Barros
Joao Barros
We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols yet are assumed to be potential eavesdroppers (i.e. "nice but curious"). For this setup, which differs from wiretapping scenarios considered previously, we develop a natural algebraic security criterion, and prove several of its key properties. A preliminary analysis of the impact of network topology on the overall network coding security, in particular for complete directed acyclic graphs, is also included.