49 citations · 317 across the 61 of their papers we have counts for
59 papers · 1 filter
Efficient Probabilistic Parity Shaping for Irregular Repeat-Accumulate LDPC Codes
Diego Lentner, Thomas Wiegart, Richard D. Wesel
Algorithms are presented that efficiently shape the parity bits of systematic irregular repeat-accumulate (IRA) low-density parity-check (LDPC) codes by following the sequential en…
Feedback Communication Over the BSC with Sparse Feedback times and Causal Encoding
Amaael Antonini, Rita Gimelshein, Richard D. Wesel
Posterior matching uses variable-length encoding of the message controlled by noiseless feedback of the received symbols to achieve high rates for short average blocklengths. Tradi…
ELF Codes: Concatenated Codes with an Expurgating Linear Function as the Outer Code
Richard Wesel, Amaael Antonini, Linfang Wang +3
An expurgating linear function (ELF) is a linear outer code that disallows the low-weight codewords of the inner code. ELFs can be designed either to maximize the minimum distance…
Systematic Transmission With Fountain Parity Checks for Erasure Channels With Stop Feedback
Hengjie Yang, Richard D. Wesel
In this paper, we present new achievability bounds on the maximal achievable rate of variable-length stop-feedback (VLSF) codes operating over a binary erasure channel (BEC) at a f…
Probabilistic Shaping for Asymmetric Channels and Low-Density Parity-Check Codes
Thomas Wiegart, Linfang Wang, Diego Lentner +1
An algorithm is proposed to encode low-density parity-check (LDPC) codes into codewords with a non-uniform distribution. This enables power-efficient signalling for asymmetric chan…
Achievable Rates and Low-Complexity Encoding of Posterior Matching for the BSC
Amaael Antonini, Rita Gimelshein, Richard Wesel
Horstein, Burnashev, Shayevitz and Feder, Naghshvar et al. and others have studied sequential transmission of a K-bit message over the binary symmetric channel (BSC) with full, noi…