activity
20152026
most citedMaximum Likelihood Latent Space Embedding of Logistic Random Dot Product Graphs

3 citations · 4 across the 8 of their papers we have counts for

collaborators
Showing cs.ITShow all

5 papers · 1 filter

cs.IT2026

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…

cs.IT2026

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…

cs.IT2025★ 1 cited

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…

cs.IT2025

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…

cs.IT2025

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…