3 citations · 4 across the 8 of their papers we have counts for
10 papers
The Benefit of Decoder-Provided Pilots in Highly Dynamic Channels
Duschia Bodet, Muriel Médard, Muralidhar Rangaswamy +1
Communications in highly dynamic channels relying on training-based channel estimation experience a trade-off between increasing channel measurement accuracy by sending more freque…
Pricing Innovation Under Latency Constraints: A Mean-Field Analysis of Coded Payload Delivery
Muriel Médard, Tarun Chitra, Moritz Grundei +1
We study pricing mechanisms for low-latency payload delivery in settings where participant rewards depend on the time required to reconstruct a payload. In such environments, the d…
Efficient Soft-Output Guessing for Enhanced Quantum Tanner Code Decoding
Lukas Rapp, Muriel Médard, Eugene Tang +1
We introduce a generalized low-density parity-check decoding framework for quantum Tanner codes utilizing soft-output guessing random additive noise decoding (SOGRAND). By soft-out…
OPTIMUM-DERAM: Highly Consistent, Scalable, and Secure Multi-Object Memory using RLNC
Nicolas Nicolaou, Kishori M. Konwar, Moritz Grundei +3
This paper introduces OPTIMUM-DERAM, a highly consistent, scalable, secure, and decentralized shared memory solution. Traditional distributed shared memory implementations offer mu…
Improving the decoding performance of CA-polar codes
Jiewei Feng, Peihong Yuan, Ken R. Duffy +1
We investigate the use of modern code-agnostic decoders to convert CA-SCL from an incomplete decoder to a complete one. When CA-SCL fails to identify a codeword that passes the CRC…
Guessing Decoding of Short Blocklength Codes
Qianfan Wang, Jifan Liang, Peihong Yuan +3
Future beyond-5G and 6G systems demand ultra-reliable, low-latency communication with short blocklengths, motivating the development of universal decoding algorithms. Guessing deco…
Group Probability Decoding of Turbo Product Codes over Higher-Order Fields
Lukas Rapp, Muriel Médard, Ken R. Duffy
Binary turbo product codes (TPCs) are powerful error-correcting codes constructed from short component codes. Traditionally, turbo product decoding passes log likelihood ratios (LL…
Enhanced GCD through ORBGRAND-AI: Exploiting Partial and Total Correlation in Noise
Jiewei Feng, Ken R. Duffy, Muriel Médard
There have been significant advances in recent years in the development of forward error correction decoders that can decode codes of any structure, including practical realization…
LINC: An In-Network Coding Approach to Tame Packet Loss in Hybrid Wireless-Fiber Backbones
Benoit Pit-Claudel, Muriel Médard, Manya Ghobadi
The emergence of ultra-low latency applications, such as financial transactions, has driven the development of hybrid backbone networks that rely on fiber, satellite, and microwave…
Maximum Likelihood Latent Space Embedding of Logistic Random Dot Product Graphs
Luke O'Connor, Muriel Médard, Soheil Feizi
A latent space model for a family of random graphs assigns real-valued vectors to nodes of the graph such that edge probabilities are determined by latent positions. Latent space m…