pith. sign in

arxiv: 2605.00761 · v1 · submitted 2026-05-01 · 💻 cs.IT · eess.SP· math.IT

The Benefit of Decoder-Provided Pilots in Highly Dynamic Channels

Duschia Bodet , Muriel M\'edard , Muralidhar Rangaswamy , Ken Duffy This is my paper

Pith reviewed 2026-05-09 18:42 UTC · model grok-4.3

classification 💻 cs.IT eess.SPmath.IT
keywords decoder-provided pilotschannel estimationdynamic channelsforward error correctiontime-varying channelsnon-iterative estimationfast fadinginformation theoretic limits
0
0 comments X

The pith

Decoded codewords serve as pilots to track highly dynamic channels without extra training or iteration.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper shows that successfully decoded codewords can be reused as known training sequences to update channel estimates at the receiver in time-varying environments. Standard training-based systems must balance sending more pilots for better accuracy against sending more data, but decoder-provided pilots avoid this trade-off by leveraging forward error correction that is already present. The method is non-iterative and works with any modulation, code, or decoder, making it suitable for low-latency needs in fast-fading scenarios. From an information-theoretic viewpoint the authors derive the limits on how well such pilots can sense the channel while still carrying data. Simulations confirm clear performance gains, including extra benefits from soft outputs when coding across frequency and from short codes when coding across time in rapid fading.

Core claim

Decoder-provided pilots consist of feeding decoded codewords back to the channel estimator as if they were pilot symbols, enabling non-iterative, modulation- and code-agnostic updates to the estimate. The paper derives the fundamental information-theoretic limits on the joint ability to sense the channel and transmit data with this approach, and simulations demonstrate that it significantly improves performance compared with conventional pilot-only schemes.

What carries the argument

Decoder-provided pilots: the reuse of post-decoding codewords as accurate known training sequences to refine the receiver's channel estimate in real time.

If this is right

  • Simulations show significant performance gains over standard training in dynamic channels.
  • Soft-output decoding yields further improvement when codewords span frequency.
  • Short codes of a given rate can outperform longer codes when coding spans time in fast fading.
  • The scheme supports simultaneous channel sensing and data transmission up to the derived information-theoretic limits.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The technique could lower the fraction of symbols reserved for dedicated pilots in mobile wireless links.
  • It may combine naturally with existing adaptive modulation and coding loops without redesigning the inner transceiver.
  • Real-world tests with measured decoding error statistics would directly test whether the low-error-rate premise holds under mobility.

Load-bearing premise

The post-decoding error rate must be low enough that erroneous codewords do not introduce bias when treated as perfect pilot symbols.

What would settle it

A simulation or measurement in which realistic decoding errors are inserted into the reused codewords and the resulting channel-estimate quality or overall error rate becomes worse than with no decoder feedback at all.

Figures

Figures reproduced from arXiv: 2605.00761 by Duschia Bodet, Ken Duffy, Muralidhar Rangaswamy, Muriel M\'edard.

Figure 1
Figure 1. Figure 1: System model showing the block diagram for the system: (a) only relying on designated training sequences, (b) using view at source ↗
Figure 2
Figure 2. Figure 2: Capacity of time-varying channel using the upperbound view at source ↗
Figure 3
Figure 3. Figure 3: Bit error rate (BER) performance of a eBCH2 [1024, 676] component code with 11-bit CRC in a single-tap Rayleigh fading channel with tI = 100 codewords and DI = 25K symbols higher modulation orders can enter a vicious cycle of error propagation that degrades the performance until the signal strength is high enough for HD detection to work well. This result points to the robustness that FEC provides decoder￾… view at source ↗
Figure 6
Figure 6. Figure 6: eBCH2 [1024, 676] with 11-bit CRC in a Dicode channel with ρ = 0.25 DI = 10K symbols Considering the system relying only on the designated training pilots, shown in blue, the effective information rate peaks when TI ≈ 20 codewords and decreases with training intervals smaller or larger. This peak corresponds to when tI ≈ τC . For the demodulator-provided pilots system, the performance is generally worse or… view at source ↗
Figure 5
Figure 5. Figure 5: Bit error rate (BER) performance of a eBCH2 [1024, 676] component code with 11-bit CRC and 16-QAM signaling in a (a) Dicode channel with ρ = 0.25 DI = 10K symbols; (b) Dicode channel with ρ = 0.25 DI = 1K symbols; (c) Multi-tap channel with ρ = [0.5, 0.25, 0.125] DI = 10K symbols time. In this case, the decoder-provided pilots thoroughly outperform the CRC-provided pilots because unlike in the slow fading … view at source ↗
Figure 7
Figure 7. Figure 7: Bit error rate (BER) performance of a eBCH2 [1024, 676] code using 16-QAM OFDM with a short coherence time (DI = 25 OFDM symbols) and a coherence bandwidth equal to the subcarrier spacing. We set the tI = 100 OFDM symbols. Soft-Output Enhances Performance for Multi-Carrier Systems If soft-output is available for a multi-carrier waveform, we can use the reliability-thresholded decoder-provided pilots presen… view at source ↗
Figure 9
Figure 9. Figure 9: Bit error rate (BER) performance of an eBCH[128, 113] code in a single-tap Rayleigh fading channel with tI = 100 codewords and DI = 1K symbols using 16-QAM signaling. Performance of Decoder-Provided Pilots with Non-Systematic Codes Beyond the number of errors found in the decoding, how these errors propagate will also depend on the structure of the code used. In general, error correcting codes fall into tw… view at source ↗
Figure 10
Figure 10. Figure 10: Bit error rate (BER) performance of the [128, 54] CA Polar code in 5G NR in a single-tap Rayleigh channel with tI = 100 codewords, DI = 1K symbols, and 16-QAM signaling. Compared with the systematic eBCH2 code from view at source ↗
Figure 12
Figure 12. Figure 12: BLER performance using BPSK signaling with view at source ↗
Figure 11
Figure 11. Figure 11: Block Error Rate (BLER) performance using BPSK view at source ↗
read the original abstract

Communications in highly dynamic channels relying on training-based channel estimation experience a trade-off between increasing channel measurement accuracy by sending more frequent training sequences and increasing data rate by sending fewer training sequences. Simultaneously, most communication systems use forward error correction to enable error detection and correction at the receiver. This paper presents decoder-provided pilots for time-varying channels by using decoded codewords as training sequences to update the channel estimate at the receiver. In contrast to approaches such as data-aided channel estimation, decision-feedback equalization, joint channel estimation and error correction, and turbo equalization, the decoder-provided pilots approach is non-iterative, which is ideal for low-latency requirements in highly dynamic scenarios. Furthermore, it is modulation-, code-, and decoder-agnostic, meaning it can be implemented on top of virtually any communication system that uses forward error correction. From an information-theoretic perspective, we derive the fundamental limits of decoder-provided pilots' ability to simultaneously sense the channel and transmit data. Simulation results demonstrate that decoder-provided pilots significantly improve performance, that when coding across frequency, soft-output can further enhance performance, and that when coding across time, short codes can outperform long codes of the same rate in fast-fading channels.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes using decoded codewords as 'decoder-provided pilots' to update channel estimates in highly dynamic time-varying channels. This non-iterative approach is presented as modulation-, code-, and decoder-agnostic, contrasting it with iterative methods like turbo equalization. From an information-theoretic perspective, the paper derives fundamental limits on the scheme's ability to simultaneously sense the channel and transmit data. Simulations are used to demonstrate performance improvements, benefits of soft outputs when coding across frequency, and advantages of short codes over long codes of the same rate in fast-fading scenarios when coding across time.

Significance. If the derived limits correctly model the joint distribution including decoding errors rather than assuming error-free pilots, the work could provide a useful framework for trading off training overhead and data rate in fast-fading channels while leveraging existing FEC. The non-iterative and agnostic properties are practical strengths for low-latency systems. The combination of analytic bounds and simulation results is a positive aspect, though verification of the limits' assumptions is needed to assess impact.

major comments (2)
  1. [§3] §3 (Information-Theoretic Limits): The mutual-information expressions for the fundamental limits must be checked against whether they average over the probability of decoding errors (i.e., treating decoded symbols as random variables correlated with the true symbols) or instead condition on correct decoding and model the decoded symbols as deterministic known pilots. The latter would describe an oracle-aided system rather than the proposed decoder-provided pilot scheme; this distinction is load-bearing because the paper targets highly dynamic channels where post-decoding error rates are non-negligible and can bias channel estimates.
  2. [§4] §4 (Simulation Results): The reported performance gains rely on specific channel models, SNR ranges, and code parameters, but the manuscript does not provide sufficient detail on how the decoder-provided pilots are generated in the presence of residual errors or on the exact baseline (e.g., conventional pilot-only estimation) to allow independent reproduction. This weakens the claim that the scheme 'significantly improves performance' in the regime where the analytic limits are most relevant.
minor comments (2)
  1. [Abstract] Abstract: The phrase 'fundamental limits of decoder-provided pilots' ability to simultaneously sense the channel and transmit data' should be accompanied by a brief statement of the key modeling assumptions (e.g., whether decoding errors are included in the mutual-information calculation).
  2. [§2] Notation: The channel model (e.g., the Doppler spectrum or correlation function) is referenced but not explicitly restated in the information-theoretic section; adding a self-contained definition would improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed comments on our manuscript. We address each major comment point by point below, providing clarifications on our modeling choices and committing to revisions that enhance reproducibility and explicitness without altering the core contributions.

read point-by-point responses

  1. Referee: [§3] §3 (Information-Theoretic Limits): The mutual-information expressions for the fundamental limits must be checked against whether they average over the probability of decoding errors (i.e., treating decoded symbols as random variables correlated with the true symbols) or instead condition on correct decoding and model the decoded symbols as deterministic known pilots. The latter would describe an oracle-aided system rather than the proposed decoder-provided pilot scheme; this distinction is load-bearing because the paper targets highly dynamic channels where post-decoding error rates are non-negligible and can bias channel estimates.

    Authors: We thank the referee for this important observation. Our mutual-information expressions in §3 are explicitly derived by averaging over the joint distribution p(decoded symbols, true symbols, channel), which incorporates the probability of decoding errors. The decoded symbols are treated as random variables whose statistical dependence on the true symbols is governed by the decoder's error rate (modeled via the effective channel transition probabilities). This is not an oracle model conditioned on error-free decoding. We will revise the manuscript to add an explicit statement and a brief derivation step in §3 (or a short appendix) confirming that the limits account for residual errors and their potential bias on channel estimates. revision: yes

  2. Referee: [§4] §4 (Simulation Results): The reported performance gains rely on specific channel models, SNR ranges, and code parameters, but the manuscript does not provide sufficient detail on how the decoder-provided pilots are generated in the presence of residual errors or on the exact baseline (e.g., conventional pilot-only estimation) to allow independent reproduction. This weakens the claim that the scheme 'significantly improves performance' in the regime where the analytic limits are most relevant.

    Authors: We agree that additional implementation details are needed for reproducibility. In the revised §4, we will expand the description to include: (i) how decoder-provided pilots are generated from decoded codewords, specifying hard-decision vs. soft-output usage and explicit handling of residual errors (e.g., via weighted updates or error-probability-adjusted channel models); (ii) the precise conventional pilot-only baseline, including pilot insertion rate, estimation algorithm, and interpolation method; and (iii) any relevant pseudocode or equations for the non-iterative update step. These additions will strengthen the connection to the analytic limits without changing the reported results. revision: yes

Circularity Check

0 steps flagged

No significant circularity; information-theoretic limits are derived independently

full rationale

The paper derives fundamental limits from an information-theoretic perspective on decoder-provided pilots for simultaneous channel sensing and data transmission in dynamic channels. No load-bearing step reduces the claimed bounds to fitted inputs by construction, self-citations for uniqueness theorems, or ansatzes smuggled via prior work. The non-iterative, modulation-agnostic scheme is positioned with explicit contrasts to iterative methods like turbo equalization, and simulations are presented as separate validation. The derivation chain remains self-contained against external mutual-information benchmarks under the modeled assumptions, with no evidence of self-definitional loops or renamed empirical patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no explicit free parameters, axioms, or invented entities; the information-theoretic derivation is asserted but not shown.

pith-pipeline@v0.9.0 · 5522 in / 1113 out tokens · 32793 ms · 2026-05-09T18:42:54.826990+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

41 extracted references · 41 canonical work pages

  1. [1]

    Wireless Communications–Principles and Practice, (The Book End)

    T. S. Rappaport, “Wireless Communications–Principles and Practice, (The Book End).”Microwave Journal, vol. 45, no. 12, pp. 128–129, 2002

    work page 2002

  2. [2]

    The TeraNova platform: An integrated testbed for ultra- broadband wireless communications at true Terahertz frequencies,

    P. Sen, D. A. Pados, S. N. Batalama, E. Einarsson, J. P. Bird, and J. M. Jornet, “The TeraNova platform: An integrated testbed for ultra- broadband wireless communications at true Terahertz frequencies,” Computer Networks, vol. 179, p. 107370, 2020

    work page 2020

  3. [3]

    Exploiting error-control coding and cyclic-prefix in channel estimation for coded OFDM systems,

    G. A. Al-Rawi, T. Y . Al-Naffouri, A. Bahai, and J. Cioffi, “Exploiting error-control coding and cyclic-prefix in channel estimation for coded OFDM systems,”IEEE communications letters, vol. 7, no. 8, pp. 388– 390, 2003

    work page 2003

  4. [4]

    Exploiting error-control coding in blind channel estimation,

    R. R. Lopes and J. R. Barry, “Exploiting error-control coding in blind channel estimation,” inGLOBECOM’01. IEEE Global Telecommunications Conference (Cat. No. 01CH37270), vol. 2. IEEE, 2001, pp. 1317–1321

    work page 2001

  5. [5]

    Joint error correction and fading channel estimation enhancement leveraging GRAND,

    C. Wiame, K. R. Duffy, and M. M ´edard, “Joint error correction and fading channel estimation enhancement leveraging GRAND,”arXiv preprint arXiv:2506.14756, 2025

    work page arXiv 2025

  6. [6]

    Joint channel estimation and coding over channels with memory using polar codes,

    N. Ghaddar, Y .-H. Kim, L. B. Milstein, L. Ma, and B. K. Yi, “Joint channel estimation and coding over channels with memory using polar codes,”IEEE Transactions on Communications, vol. 69, no. 10, pp. 6575–6589, 2021

    work page 2021

  7. [7]

    Low-complexity joint channel estimation and decoding for pilot symbol-assisted modulation and multiple differential detection systems with correlated rayleigh fading,

    H.-J. Su and E. Geraniotis, “Low-complexity joint channel estimation and decoding for pilot symbol-assisted modulation and multiple differential detection systems with correlated rayleigh fading,”IEEE Transactions on Communications, vol. 50, no. 2, pp. 249–261, 2002

    work page 2002

  8. [8]

    Iterative correction of intersymbol interference: turbo-equalization,

    C. Douillard, M. J ´ez´equel, C. Berrou, D. Electronique, A. Picart, P. Didier, and A. Glavieux, “Iterative correction of intersymbol interference: turbo-equalization,”European transactions on telecommunications, vol. 6, no. 5, pp. 507–511, 1995

    work page 1995

  9. [9]

    Iterative channel estimation for turbo equalization of time-varying frequency-selective channels,

    R. Otnes and M. Tuchler, “Iterative channel estimation for turbo equalization of time-varying frequency-selective channels,”IEEE Transactions on Wireless Communications, vol. 3, no. 6, pp. 1918–1923, 2005

    work page 1918

  10. [10]

    Turbo equalization: adaptive equalization and channel decoding jointly optimized,

    C. Laot, A. Glavieux, and J. Labat, “Turbo equalization: adaptive equalization and channel decoding jointly optimized,”IEEE journal on Selected Areas in Communications, vol. 19, no. 9, pp. 1744–1752, 2002

    work page 2002

  11. [11]

    Turbo equalization: Principles and new results,

    M. Tuchler, R. Koetter, and A. C. Singer, “Turbo equalization: Principles and new results,”IEEE transactions on communications, vol. 50, no. 5, pp. 754–767, 2002

    work page 2002

  12. [12]

    Data-aided channel estimation in large antenna systems,

    J. Ma and L. Ping, “Data-aided channel estimation in large antenna systems,”IEEE Transactions on Signal Processing, vol. 62, no. 12, pp. 3111–3124, 2014

    work page 2014

  13. [13]

    Soft-decision-aided channel estimation over the flat-fading channel, and an application to iterative decoding using an example LTE turbo code,

    H. Yuan and P.-Y . Kam, “Soft-decision-aided channel estimation over the flat-fading channel, and an application to iterative decoding using an example LTE turbo code,”IEEE Transactions on Wireless Communications, vol. 13, no. 11, pp. 6027–6040, 2014

    work page 2014

  14. [14]

    Data-aided channel estimator for mimo systems via reinforcement learning,

    Y .-S. Jeon, J. Li, N. Tavangaran, and H. V . Poor, “Data-aided channel estimator for mimo systems via reinforcement learning,” inICC 2020- 2020 IEEE International Conference on Communications (ICC). IEEE, 2020, pp. 1–6

    work page 2020

  15. [15]

    Deep learning based data-assisted channel estimation and detection,

    H. Hashempoor and W. Choi, “Deep learning based data-assisted channel estimation and detection,”IEEE Transactions on Machine Learning in Communications and Networking, 2025

    work page 2025

  16. [16]

    A mathematical theory of communication,

    C. E. Shannon, “A mathematical theory of communication,”The Bell system technical journal, vol. 27, no. 3, pp. 379–423, 1948

    work page 1948

  17. [17]

    New detection schemes for transmit diversity with no channel estimation,

    V . Tarokh, S. M. Alamouti, and P. Poon, “New detection schemes for transmit diversity with no channel estimation,” inICUPC’98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No. 98TH8384), vol. 2. IEEE, 1998, pp. 917–920

    work page 1998

  18. [18]

    A differential detection scheme for transmit diversity,

    V . Tarokh and H. Jafarkhani, “A differential detection scheme for transmit diversity,”IEEE Journal on Selected Areas in Communications, vol. 18, no. 7, pp. 1169–1174, 2002

    work page 2002

  19. [19]

    Differential communication in channels with mobility and delay spread using Zak- OTFS,

    S. R. Mattu, N. Mehrotra, and R. Calderbank, “Differential communication in channels with mobility and delay spread using Zak- OTFS,”IEEE Wireless Communications Letters, 2025

    work page 2025

  20. [20]

    An analysis of pilot symbol assisted modulation for rayleigh fading channels (mobile radio),

    J. K. Cavers, “An analysis of pilot symbol assisted modulation for rayleigh fading channels (mobile radio),”IEEE transactions on vehicular technology, vol. 40, no. 4, pp. 686–693, 2002

    work page 2002

  21. [21]

    Joint approximately sparse channel estimation and data detection in ofdm systems using sparse bayesian learning,

    R. Prasad, C. R. Murthy, and B. D. Rao, “Joint approximately sparse channel estimation and data detection in ofdm systems using sparse bayesian learning,”IEEE Transactions on Signal Processing, vol. 62, no. 14, pp. 3591–3603, 2014

    work page 2014

  22. [22]

    Decision feedback equalization,

    C. A. Belfiore and J. H. Park, “Decision feedback equalization,” Proceedings of the IEEE, vol. 67, no. 8, pp. 1143–1156, 1979

    work page 1979

  23. [23]

    MMSE decision-feedback equalizers and coding. I. equalization results,

    J. M. Cioffi, G. P. Dudevoir, M. V . Eyuboglu, and G. D. Forney, “MMSE decision-feedback equalizers and coding. I. equalization results,”IEEE transactions on Communications, vol. 43, no. 10, pp. 2582–2594, 1995

    work page 1995

  24. [24]

    An adaptive decision feedback equalizer,

    D. George, R. Bowen, and J. Storey, “An adaptive decision feedback equalizer,”IEEE Transactions on Communication Technology, vol. 19, no. 3, pp. 281–293, 1971

    work page 1971

  25. [25]

    Combined coding and training for unknown ISI channels,

    O. Coskun and K. M. Chugg, “Combined coding and training for unknown ISI channels,”IEEE transactions on communications, vol. 53, no. 8, pp. 1310–1322, 2005

    work page 2005

  26. [26]

    Optimal design and placement of pilot symbols for channel estimation,

    M. Dong and L. Tong, “Optimal design and placement of pilot symbols for channel estimation,”IEEE Transactions on Signal Processing, vol. 50, no. 12, pp. 3055–3069, 2002

    work page 2002

  27. [27]

    Channel estimation techniques based on pilot arrangement in OFDM systems,

    S. Coleri, M. Ergen, A. Puri, and A. Bahai, “Channel estimation techniques based on pilot arrangement in OFDM systems,”IEEE Transactions on broadcasting, vol. 48, no. 3, pp. 223–229, 2002

    work page 2002

  28. [28]

    Turbo equalization,

    R. Koetter, A. C. Singer, and M. Tuchler, “Turbo equalization,”IEEE signal processing magazine, vol. 21, no. 1, pp. 67–80, 2004

    work page 2004

  29. [29]

    Iterative channel estimation and decoding of pilot symbol assisted turbo codes over flat-fading channels,

    M. C. Valenti and B. D. Woerner, “Iterative channel estimation and decoding of pilot symbol assisted turbo codes over flat-fading channels,” IEEE journal on Selected Areas in Communications, vol. 19, no. 9, pp. 1697–1705, 2002

    work page 2002

  30. [30]

    Joint channel estimation and decoding for underwater acoustic communication with a short pilot sequence,

    X. Qin and R. Diamant, “Joint channel estimation and decoding for underwater acoustic communication with a short pilot sequence,”IEEE Journal of Oceanic Engineering, vol. 48, no. 2, pp. 526–541, 2023

    work page 2023

  31. [31]

    “Turbo DPSK

    P. Hoeher and J. Lodge, ““Turbo DPSK”: iterative differential psk demodulation and channel decoding,”IEEE Transactions on Communications, vol. 47, no. 6, pp. 837–843, 2002

    work page 2002

  32. [32]

    Multiple differential detection of parallel concatenated convolutional (turbo) codes in correlated fast rayleigh fading,

    I. D. Marsland and P. T. Mathiopoulos, “Multiple differential detection of parallel concatenated convolutional (turbo) codes in correlated fast rayleigh fading,”IEEE Journal on Selected Areas in Communications, vol. 16, no. 2, pp. 265–275, 2002

    work page 2002

  33. [33]

    Ordered reliability bits guessing random additive noise decoding,

    K. R. Duffy, W. An, and M. M ´edard, “Ordered reliability bits guessing random additive noise decoding,”IEEE Transactions on Signal Processing, vol. 70, pp. 4528–4542, 2022

    work page 2022

  34. [34]

    Capacity-achieving guessing random additive noise decoding,

    K. R. Duffy, J. Li, and M. M ´edard, “Capacity-achieving guessing random additive noise decoding,”IEEE Transactions on Information Theory, vol. 65, no. 7, pp. 4023–4040, 2019

    work page 2019

  35. [35]

    The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel,

    M. M ´edard, “The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel,” IEEE Transactions on Information theory, vol. 46, no. 3, pp. 933–946, 2002

    work page 2002

  36. [36]

    T. K. Moon,Error correction coding: mathematical methods and algorithms. John Wiley & Sons, 2020

    work page 2020

  37. [37]

    Binary adaptive coded pilot symbol assisted modulation over rayleigh fading channels without feedback,

    I. Abou-Fayc ¸al, M. M ´edard, and U. Madhow, “Binary adaptive coded pilot symbol assisted modulation over rayleigh fading channels without feedback,”IEEE Transactions on Communications, vol. 53, no. 6, pp. 1036–1046, 2005

    work page 2005

  38. [38]

    GRAND for fading channels using pseudo-soft information,

    H. Sarieddeen, M. M ´edard, and K. R. Duffy, “GRAND for fading channels using pseudo-soft information,” inIEEE Global Communications Conference. IEEE, 2022, pp. 3502–3507

    work page 2022

  39. [39]

    Soft-output (SO) GRAND and iterative decoding to outperform ldpc codes,

    P. Yuan, M. M ´edard, K. Galligan, and K. R. Duffy, “Soft-output (SO) GRAND and iterative decoding to outperform ldpc codes,”IEEE Transactions on Wireless Communications, 2025

    work page 2025

  40. [40]

    Cyclic redundancy code (CRC) polynomial selection for embedded networks,

    P. Koopman and T. Chakravarty, “Cyclic redundancy code (CRC) polynomial selection for embedded networks,” inInternational Conference on Dependable Systems and Networks. IEEE, 2004, pp. 145–154

    work page 2004

  41. [41]

    Design of polar codes in 5G new radio,

    V . Bioglio, C. Condo, and I. Land, “Design of polar codes in 5G new radio,”IEEE Communications Surveys & Tutorials, vol. 23, no. 1, pp. 29–40, 2020

    work page 2020