activity
20092023
most citedCapacity-achieving Guessing Random Additive Noise Decoding (GRAND)

229 citations · 876 across the 52 of their papers we have counts for

collaborators
Showing 2022Show all

13 papers · 1 filter

cs.IT2022★ 4 cited

Physical layer insecurity

Muriel Médard, Ken R. Duffy

In the classic wiretap model, Alice wishes to reliably communicate to Bob without being overheard by Eve who is eavesdropping over a degraded channel. Systems for achieving that ph…

cs.IT2022

Soft detection physical layer insecurity

Ken R. Duffy, Muriel Medard

We establish that during the execution of any Guessing Random Additive Noise Decoding (GRAND) algorithm, an interpretable, useful measure of decoding confidence can be evaluated. T…

cs.IT2022

GRAND-assisted Optimal Modulation

Basak Ozaydin, Muriel Médard, Ken Duffy

Optimal modulation (OM) schemes for Gaussian channels with peak and average power constraints are known to require nonuniform probability distributions over signal points, which pr…

cs.IT2022

A General Security Approach for Soft-information Decoding against Smart Bursty Jammers

Furkan Ercan, Kevin Galligan, Ken R. Duffy +3

Malicious attacks such as jamming can cause significant disruption or complete denial of service (DoS) to wireless communication protocols. Moreover, jamming devices are getting sm…

cs.IT2022

Block turbo decoding with ORBGRAND

Kevin Galligan, Muriel Médard, Ken R. Duffy

Guessing Random Additive Noise Decoding (GRAND) is a family of universal decoding algorithms suitable for decoding any moderate redundancy code of any length. We establish that, th…

cs.IT2022

Soft decoding without soft demapping with ORBGRAND

Wei An, Muriel Medard, Ken R. Duffy

For spectral efficiency, higher order modulation symbols confer information on more than one bit. As soft detection forward error correction decoders assume the availability of inf…