pith. sign in

arxiv: 2501.07561 · v4 · submitted 2025-01-13 · 💻 cs.IT · math.IT

Design and Analysis of a Concatenated Code for Intersymbol Interference Wiretap Channels

Aria Nouri , Reza Asvadi , Jun Chen This is my paper

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

classification 💻 cs.IT math.IT
keywords concatenated codingISI wiretap channelsLDPC codestrellis codessecrecy capacityinformation leakagedegree distribution optimization
0
0 comments X

The pith

A concatenated LDPC-trellis scheme achieves tight lower bounds on secrecy capacity for ISI wiretap channels while driving the leakage upper bound to zero.

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

The paper first derives the secrecy capacity of intersymbol interference wiretap channels. It then constructs a practical two-stage code that places irregular LDPC codes in the outer layer and specially designed trellis codes in the inner layer. The trellis stage converts the uniform LDPC output into a Markov source whose statistics match those required by the capacity expression. Degree-distribution optimization on the LDPC stage is shown to force the estimated upper bound on information leakage toward zero, thereby satisfying the weak secrecy criterion without sacrificing the achievable rate.

Core claim

The central claim is that the proposed concatenated scheme, built from outer LDPC codes nested inside inner trellis codes, attains tight lower bounds on the secrecy capacity of ISI wiretap channels; further, optimization of the irregular LDPC degree distributions reduces the upper bound on the information leakage rate to zero, meeting the weak secrecy criterion.

What carries the argument

The nested wiretap-code structure in which outer LDPC codes generate uniformly distributed words that inner trellis codes reshape into a Markov process whose transition probabilities achieve the secrecy-capacity lower bound.

If this is right

  • Reliable rates arbitrarily close to the secrecy capacity become achievable with finite-length codes over ISI wiretap channels.
  • The same concatenated architecture can be reused for any channel whose secrecy capacity is achieved by a Markov input distribution.
  • Weak secrecy is obtained solely by degree optimization rather than by explicit randomness extraction at the encoder.

Where Pith is reading between the lines

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

  • If the inner trellis stage can be made rate-preserving for other memory channels, the same outer-code optimization may extend to non-ISI wiretap models.
  • The leakage-bound reduction to zero suggests that finite-length LDPC ensembles can be tuned to satisfy strong secrecy in the limit, though the paper stops at the weak criterion.

Load-bearing premise

A trellis code exists that maps any uniform LDPC codeword sequence into the exact Markov process required by the secrecy capacity without rate loss or extra leakage.

What would settle it

Numerical optimization of the LDPC degree distributions fails to drive the computed upper bound on leakage below a positive constant, or the designed trellis code produces a stationary distribution that deviates measurably from the capacity-achieving Markov chain.

Figures

Figures reproduced from arXiv: 2501.07561 by Aria Nouri, Jun Chen, Reza Asvadi.

Figure 1
Figure 1. Figure 1: (a) Trellis section of an FSMC, representing the EPR4 channel and the collection of branches βf (i, j) = (i, x, u, j) for all (i, j) ∈ Bˇf . (b) Trellis section of a 3-rd order E-FSMC, representing the DICODE channel and the collection of branches βe(i, ℓ, j) ≜ (i, x 3 , u 3 , j) for all (i, ℓ, j) ∈ Bˇe. between sf (t−1), x(t)  and sf (t−1), bf (t)  , for all t ∈ Z. In this case, the factor on the RHS of… view at source ↗
Figure 2
Figure 2. Figure 2: Trellis section of a 2-nd order E-FSMC that represents an ISI-WTC, comprising a DICODE channel as Bob’s channel and an EPR4 channel as Eve’s channel. Each branch of the trellis section is labeled by βe(i, ℓ, j) ≜ (i, x 2 , u 2 , v 2 , j) for all (i, ℓ, j) ∈ Bˇe. For any positive integer N, the joint PMF/PDF of B N e and Y nN conditioned on Se(0) = se(0) and X nN = x nN is pBN e ,YnN |Se (0),XnN b N e , y n… view at source ↗
Figure 3
Figure 3. Figure 3: Wolf-Ungerboeck code of rate 1/2 and the collection of [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 5
Figure 5. Figure 5: Normal factor graph representation of the superchannel. [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Trellis section of a superchannel resulted from concatenating the trellis code depicted in Fig. [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Soft-output messages from FNs to VNs at Bob’s decoder. (Refer to equations ( [PITH_FULL_IMAGE:figures/full_fig_p010_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Normal graph of the two-stage concatenated code, comprising a superchannel ( [PITH_FULL_IMAGE:figures/full_fig_p011_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: The i.u.d. secure rate R (4) iud, the constrained secrecy capacity R (4) csc of the 4-th order E-FSMC modeling the ISI-WTC in Example 1, and the i.u.d. secure rate of the superchannel R SC iud in Table V (Example 4) for SNRE dB = −4.0. Note that the superchannel is specifically designed for operating at SNRB dB =SNRE dB =−4.0. ordinal optimization. For the SNR values of Example 1, the i.u.d. secure rate of… view at source ↗
Figure 10
Figure 10. Figure 10: Multi-stage decoder for estimating m (l) , assuming that the symbols (m (1) , . . . , m (l−1)) are successfully decoded without error (1 ≤ l ≤ m). the asymptotic error probability of Frank’s decoder (ϵ F ≜ limN′→∞ ϵ F nN′ ) is approximated by applying the following modifications to the density evolution algorithm. (i) Since Frank’s and Eve’s observations are identical (Remark 6), to evolve f (ı) vf (ξ) th… view at source ↗
Figure 11
Figure 11. Figure 11: The average asymptotic performance of Bob’s, Eve’s, and [PITH_FULL_IMAGE:figures/full_fig_p015_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: (a): Gain-to-noise power spectrum ratios of Bob’s and Eve’s point-to-point channels in dB/Hz. (b): Power spectra of sequences produced by Markov sources optimized for the 1-st order and 4-th order E-FSMCs representing the considered ISI-WTC, and the power spectrum of a sequence generated by the Markov source specified in Table I, satisfying the upper bound constraint in (11). VI. FINITE BLOCKLENGTH REGIME… view at source ↗
Figure 13
Figure 13. Figure 13: Power spectra of sample codewords generated by the inner [PITH_FULL_IMAGE:figures/full_fig_p016_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: The bit error rate of the constructed code [PITH_FULL_IMAGE:figures/full_fig_p017_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: Time delays between transmitted signals from the antenna [PITH_FULL_IMAGE:figures/full_fig_p018_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: Power-delay profile of the multipath channel associated with [PITH_FULL_IMAGE:figures/full_fig_p019_16.png] view at source ↗
Figure 18
Figure 18. Figure 18: Generalization of the one-time stochastic encoder in [ [PITH_FULL_IMAGE:figures/full_fig_p020_18.png] view at source ↗
read the original abstract

We propose a two-stage concatenated coding scheme for reliable and secure communication over intersymbol interference wiretap channels. We first establish the secrecy capacity. Then, motivated by the theoretical codes that achieve the secrecy capacity, our scheme integrates low-density parity-check (LDPC) codes in the outer stage, forming a nested structure of wiretap codes, with trellis codes in the inner stage to improve achievable secure rates. The trellis code is specifically designed to transform the uniformly distributed codewords produced by the LDPC code stage into a Markov process, achieving tight lower bounds on the secrecy capacity. We further estimate the information leakage rate of the proposed scheme using an upper bound. To meet the weak secrecy criterion, we optimize degree distributions of the irregular LDPC codes at the outer stage, essentially driving the estimated upper bound on the information leakage rate to zero.

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 a two-stage concatenated coding scheme for ISI wiretap channels: an outer nested irregular LDPC wiretap code followed by an inner trellis code that maps uniform LDPC outputs to a stationary Markov process. It first claims to establish the secrecy capacity, then asserts that the scheme achieves tight lower bounds on this capacity; degree-distribution optimization is used to drive an upper bound on the information leakage rate to zero, meeting the weak secrecy criterion.

Significance. If the trellis mapping preserves the exact input statistics required for the secrecy-capacity lower bound without rate loss and if the leakage bound is independent of the optimized degrees, the construction would supply a practical, optimizable coding scheme for a non-trivial class of wiretap channels with memory. The explicit use of nested wiretap codes and the Markov-motivated inner stage are concrete contributions that could be useful for further work on channels with ISI.

major comments (2)
  1. [Abstract / trellis inner code] Abstract and trellis-code design section: the central claim that the inner trellis code converts uniform i.i.d. LDPC codewords into the precise stationary Markov process that attains the secrecy-capacity lower bound, without rate loss or secrecy degradation, is load-bearing; no generator matrix, state diagram, transition-probability verification, or rate calculation is referenced to confirm that the marginal distribution and rate are exactly preserved.
  2. [Leakage bound and degree optimization] Leakage estimation and LDPC optimization: the information leakage rate is bounded above and the bound is then driven to zero by optimizing the free parameters (LDPC degree distributions); it is unclear whether the upper bound expression remains independent of these parameters or whether the optimization step effectively defines the reported leakage value, which would undermine the claim of an independently verified achievable rate.
minor comments (2)
  1. [Abstract] The abstract states that secrecy capacity is established but supplies no outline of the derivation or the channel model assumptions; a short paragraph in the introduction would improve readability.
  2. [Notation] Notation for the Markov process statistics and the resulting secrecy rate expressions should be introduced once and used consistently; several symbols appear without prior definition in the abstract-level description.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful review and constructive feedback. Below we respond point-by-point to the major comments, indicating where revisions will be made to improve clarity.

read point-by-point responses

  1. Referee: [Abstract / trellis inner code] Abstract and trellis-code design section: the central claim that the inner trellis code converts uniform i.i.d. LDPC codewords into the precise stationary Markov process that attains the secrecy-capacity lower bound, without rate loss or secrecy degradation, is load-bearing; no generator matrix, state diagram, transition-probability verification, or rate calculation is referenced to confirm that the marginal distribution and rate are exactly preserved.

    Authors: The trellis code is constructed specifically to map the uniform i.i.d. outputs of the outer LDPC stage onto the exact stationary Markov process that attains the secrecy-capacity lower bound. We will revise the manuscript to include the generator matrix, state diagram, explicit transition-probability verification, and rate calculation demonstrating that the marginal distribution and rate are preserved without loss or secrecy degradation. revision: yes

  2. Referee: [Leakage bound and degree optimization] Leakage estimation and LDPC optimization: the information leakage rate is bounded above and the bound is then driven to zero by optimizing the free parameters (LDPC degree distributions); it is unclear whether the upper bound expression remains independent of these parameters or whether the optimization step effectively defines the reported leakage value, which would undermine the claim of an independently verified achievable rate.

    Authors: The upper bound on the information leakage rate is derived as an explicit function of the LDPC degree distributions (and other fixed parameters) prior to any optimization. The subsequent optimization identifies degree distributions for which the bound evaluates to zero, confirming that the weak secrecy criterion is met. The bound expression itself is independent of the particular optimized values; the optimization merely demonstrates that suitable parameters exist. We will add a clarifying sentence in the revised manuscript to emphasize this separation. revision: partial

Circularity Check

0 steps flagged

Derivation chain is self-contained with no circular reductions

full rationale

The paper first establishes the secrecy capacity of the ISI wiretap channel. It then constructs a concatenated scheme motivated by theoretical capacity-achieving codes, with the inner trellis code designed to map uniform LDPC outputs to the required Markov process and the outer irregular LDPC degree distributions optimized to drive an independent upper bound on leakage to zero. This is standard parameter optimization for meeting a design criterion rather than a fitted input renamed as prediction or any self-definitional reduction. No load-bearing self-citation, uniqueness theorem, or ansatz smuggling is present in the text. The central claims rest on explicit design choices whose correctness can be checked externally via the resulting rates and bounds.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

The construction rests on standard information-theoretic assumptions about secrecy capacity existence and the ability to design a trellis code that matches channel memory without rate penalty; one free parameter is the LDPC degree distribution optimized to the leakage bound.

free parameters (1)
  • LDPC degree distributions
    Optimized at the outer stage to drive the estimated upper bound on information leakage rate to zero.
axioms (1)
  • domain assumption Secrecy capacity of the ISI wiretap channel can be established and used as a benchmark for the concatenated scheme.
    Invoked as the first step before constructing the practical code.

pith-pipeline@v0.9.0 · 5674 in / 1292 out tokens · 68945 ms · 2026-05-23T05:09:28.832385+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

71 extracted references · 71 canonical work pages

  1. [1]

    Matched information rate codes for binary- input intersymbol interference wiretap channels,

    A. Nouri and R. Asvadi, “Matched information rate codes for binary- input intersymbol interference wiretap channels,” in Proc. IEEE Int. Symp. Inf. Theory , Espoo, Finland, June 2022, pp. 1163–1168

    work page 2022

  2. [2]

    How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits,

    C. Gidney and M. Eker ˚a, “How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits,” Quantum, vol. 5, p. 433, Apr. 2021

    work page 2048

  3. [3]

    Advances in quantum cryptography,

    S. Pirandola, U. L. Andersen, L. Banchi, M. Berta, D. Bunandar, R. Colbeck, D. Englund, T. Gehring, C. Lupo, C. Ottaviani, J. L. Pereira, M. Razavi, J. S. Shaari, M. Tomamichel, V . C. Usenko, G. Vallone, P. Villoresi, and P. Wallden, “Advances in quantum cryptography,” Adv. Opt. Photon., vol. 12, no. 4, pp. 1012–1236, Dec. 2020

    work page 2020

  4. [4]

    Quantum internet: A vision for the road ahead,

    S. Wehner, D. Elkouss, and R. Hanson, “Quantum internet: A vision for the road ahead,” Science, vol. 362, no. 6412, Oct. 2018

    work page 2018

  5. [5]

    When entanglement meets classical communications: Quantum teleportation for the quantum internet,

    A. S. Cacciapuoti, M. Caleffi, R. Van Meter, and L. Hanzo, “When entanglement meets classical communications: Quantum teleportation for the quantum internet,” IEEE Trans. Commun. , vol. 68, no. 6, pp. 3808–3833, June 2020

    work page 2020

  6. [6]

    Unconditionally secure quantum bit commitment is impos- sible,

    D. Mayers, “Unconditionally secure quantum bit commitment is impos- sible,” Phys. Rev. Lett., vol. 78, pp. 3414–3417, Apr. 1997

    work page 1997

  7. [7]

    The wire-tap channel,

    A. D. Wyner, “The wire-tap channel,” Bell Syst. Tech. J., vol. 54, no. 8, pp. 1355–1387, Oct. 1975

    work page 1975

  8. [8]

    An overview of information-theoretic security and privacy: Metrics, limits and applications,

    M. Bloch, O. G ¨unl¨u, A. Yener, F. Oggier, H. V . Poor, L. Sankar, and R. F. Schaefer, “An overview of information-theoretic security and privacy: Metrics, limits and applications,” IEEE J. Sel. Areas Inf. Theory , vol. 2, no. 1, pp. 5–22, Mar. 2021

    work page 2021

  9. [9]

    Physical layer security—from theory to practice,

    M. Mitev, T. M. Pham, A. Chorti, A. N. Barreto, and G. Fettweis, “Physical layer security—from theory to practice,” IEEE BITS Inf. Theory Mag., vol. 3, no. 2, pp. 67–79, Dec. 2023

    work page 2023

  10. [10]

    Single-carrier index modulation for IoT uplink,

    J. Choi, “Single-carrier index modulation for IoT uplink,” IEEE J. Sel. Top. Signal Process., vol. 13, no. 6, pp. 1237–1248, Oct. 2019

    work page 2019

  11. [11]

    Inter-symbol interference in high data rate UWB communications using energy detector receivers,

    M. Sahin and H. Arslan, “Inter-symbol interference in high data rate UWB communications using energy detector receivers,” in Proc. IEEE Int. Conf. on Ultra-Wideband, Zurich, Switzerland, Sept. 2005, pp. 176– 179

    work page 2005

  12. [12]

    Intersymbol interference and equalization for large 5G phased arrays with wide scan angles,

    Z. Zhang, Y . Yin, and G. M. Rebeiz, “Intersymbol interference and equalization for large 5G phased arrays with wide scan angles,” IEEE Trans. Microw. Theory Techn., vol. 69, no. 3, pp. 1955–1964, Mar. 2021

    work page 1955

  13. [13]

    DFT-spread orthogonal time frequency space system with superimposed pilots for terahertz integrated sensing and communication,

    Y . Wu, C. Han, and Z. Chen, “DFT-spread orthogonal time frequency space system with superimposed pilots for terahertz integrated sensing and communication,” IEEE Trans. Wirel. Commun., vol. 22, no. 11, pp. 7361–7376, Nov. 2023

    work page 2023

  14. [14]

    An overview of peak-to-average power ratio reduction techniques for multicarrier transmission,

    S. H. Han and J. H. Lee, “An overview of peak-to-average power ratio reduction techniques for multicarrier transmission,” IEEE Wirel. Commun., vol. 12, no. 2, pp. 56–65, Apr. 2005

    work page 2005

  15. [15]

    Symbol-level precoding for PAPR reduction in multi-user MISO-OFDM systems,

    Y . Qin, A. Li, Y . Lyu, X. Liao, and C. Masouros, “Symbol-level precoding for PAPR reduction in multi-user MISO-OFDM systems,” IEEE Trans. Wirel. Commun. , vol. 23, no. 9, pp. 12 484–12 498, Sept. 2024

    work page 2024

  16. [16]

    TS 38.101-1 (V18.9.0): 5G; NR; User equipment (UE) radio transmission and reception; (Release 18),

    3rd Generation Partnership Project (3GPP), “TS 38.101-1 (V18.9.0): 5G; NR; User equipment (UE) radio transmission and reception; (Release 18),” 3GPP, Technical Specification 38.101-1, Apr. 2025

    work page 2025

  17. [17]

    TR 38.821 (V16.0.0): Technical specification group radio access network; Solutions for NR to support non-terrestrial networks (NTN) (Release 16),

    ——, “TR 38.821 (V16.0.0): Technical specification group radio access network; Solutions for NR to support non-terrestrial networks (NTN) (Release 16),” 3GPP, Technical Specification 38.821, Dec. 2019

    work page 2019

  18. [18]

    Non-Terrestrial Networks (NTN) Overview,

    ——, “Non-Terrestrial Networks (NTN) Overview,” https://www.3gpp. org/technologies/ntn-overview, Apr. 2025

    work page 2025

  19. [19]

    Constrained secrecy capacity of finite-input intersymbol interference wiretap channels,

    A. Nouri, R. Asvadi, J. Chen, and P. O. V ontobel, “Constrained secrecy capacity of finite-input intersymbol interference wiretap channels,”IEEE Trans. Commun., vol. 71, no. 6, pp. 3301–3316, June 2023

    work page 2023

  20. [20]

    Maximum-likelihood sequence estimation of digital se- quences in the presence of intersymbol interference,

    G. Forney, “Maximum-likelihood sequence estimation of digital se- quences in the presence of intersymbol interference,” IEEE Trans. Inf. Theory, vol. 18, no. 3, pp. 363–378, May 1972

    work page 1972

  21. [21]

    Optimum soft-output detection for chan- nels with intersymbol interference,

    Y . Li, B. Vucetic, and Y . Sato, “Optimum soft-output detection for chan- nels with intersymbol interference,” IEEE Trans. Inf. Theory , vol. 41, no. 3, pp. 704–713, May 1995

    work page 1995

  22. [22]

    Iterative correction of intersymbol interference: Turbo-equalization,

    C. Douillard, M. J ´ez´equel, C. Berrou, D. Electronique, A. Picart, P. Di- dier, and A. Glavieux, “Iterative correction of intersymbol interference: Turbo-equalization,” Eur. Trans. Telecommun., vol. 6, no. 5, pp. 507– 511, Sept. 1995

    work page 1995

  23. [23]

    Turbo decoding for partial response channels,

    T. V . Souvignier, M. Oberg, P. H. Siegel, R. E. Swanson, and J. K. Wolf, “Turbo decoding for partial response channels,” IEEE Trans. Commun., vol. 48, no. 8, pp. 1297–1308, Aug. 2000

    work page 2000

  24. [24]

    Performance analysis of turbo-equalized partial response channels,

    M. Oberg and P. H. Siegel, “Performance analysis of turbo-equalized partial response channels,” IEEE Trans. Commun. , vol. 49, no. 3, pp. 436–444, Mar. 2001

    work page 2001

  25. [25]

    Joint message-passing decoding of LDPC codes and partial-response channels,

    B. M. Kurkoski, P. H. Siegel, and J. K. Wolf, “Joint message-passing decoding of LDPC codes and partial-response channels,” IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1410–1422, June 2002

    work page 2002

  26. [26]

    Binary intersymbol interfer- ence channels: Gallager codes, density evolution, and code performance bounds,

    A. Kav ˇci´c, X. Ma, and M. Mitzenmacher, “Binary intersymbol interfer- ence channels: Gallager codes, density evolution, and code performance bounds,” IEEE Trans. Inf. Theory , vol. 49, no. 7, pp. 1636–1652, July 2003

    work page 2003

  27. [27]

    On the application of factor graphs and the sum-product algorithm to ISI channels,

    G. Colavolpe and G. Germi, “On the application of factor graphs and the sum-product algorithm to ISI channels,” IEEE Trans. Commun., vol. 53, no. 5, pp. 818–825, May 2005

    work page 2005

  28. [28]

    Iterative detection for channels with memory,

    A. Anastasopoulos, K. M. Chugg, G. Colavolpe, G. Ferrari, and R. Ra- heli, “Iterative detection for channels with memory,”Proc. IEEE, vol. 95, no. 6, pp. 1272–1294, June 2007

    work page 2007

  29. [29]

    PR-NN: RNN-based detection for coded partial-response channels,

    S. Zheng, Y . Liu, and P. H. Siegel, “PR-NN: RNN-based detection for coded partial-response channels,” IEEE J. Sel. Areas Commun. , vol. 39, no. 7, pp. 1967–1982, July 2021

    work page 1967

  30. [30]

    Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1,

    C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1,” in Proc. IEEE Int. Conf. Commun., vol. 2, Geneva, Switzerland, May 1993, pp. 1064– 1070 vol.2

    work page 1993

  31. [31]

    Statistical inference for probabilistic func- tions of finite state Markov chains,

    L. E. Baum and T. Petrie, “Statistical inference for probabilistic func- tions of finite state Markov chains,” Ann. Math. Stat., vol. 37, no. 6, pp. 1554–1563, Dec. 1966

    work page 1966

  32. [32]

    M.A.P. bit decoding of convolutional codes,

    P. L. McAdam, L. R. Welch, and C. L. Weber, “M.A.P. bit decoding of convolutional codes,” in Proc. IEEE Int. Symp. Information Theory , Asilomar, CA, USA, Dec. 1972, p. 91

    work page 1972

  33. [33]

    Optimal decoding of linear codes for minimizing symbol error rate,

    L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inf. Theory, vol. 20, no. 2, pp. 284–287, Mar. 1974

    work page 1974

  34. [34]

    Design of capacity-approaching irregular low-density parity-check codes,

    T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, “Design of capacity-approaching irregular low-density parity-check codes,” IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619–637, Feb. 2001

    work page 2001

  35. [35]

    Optimized low-density parity-check codes for partial response channels,

    N. Varnica and A. Kav ˇci´c, “Optimized low-density parity-check codes for partial response channels,” IEEE Commun. Lett. , vol. 7, no. 4, pp. 168–170, Apr. 2003

    work page 2003

  36. [36]

    Linear-complexity ADMM updates for decoding LDPC codes in partial response channels,

    X. Jiao, J. Mu, Y . C. He, and W. Xu, “Linear-complexity ADMM updates for decoding LDPC codes in partial response channels,” IEEE Commun. Lett., vol. 23, no. 12, pp. 2200–2204, Dec. 2019

    work page 2019

  37. [37]

    l2-box ADMM decoding for LDPC codes over ISI channels,

    X. Jiao, H. Liu, J. Mu, and Y . C. He, “ l2-box ADMM decoding for LDPC codes over ISI channels,” IEEE Trans. Veh. Technol. , vol. 70, no. 4, pp. 3966–3971, Apr. 2021

    work page 2021

  38. [38]

    Interior point decoding for linear vector channels based on convex optimization,

    T. Wadayama, “Interior point decoding for linear vector channels based on convex optimization,” IEEE Trans. Inf. Theory , vol. 56, no. 10, pp. 4905–4921, Oct. 2010

    work page 2010

  39. [39]

    Distributed optimization and statistical learning via the alternating direction method of multipliers,

    S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Found. Trends Mach. Learn. , vol. 3, no. 1, pp. 1–122, Jan. 2011

    work page 2011

  40. [40]

    Determining and approaching achievable rates of binary intersymbol interference channels using multistage decoding,

    J. B. Soriaga, H. D. Pfister, and P. H. Siegel, “Determining and approaching achievable rates of binary intersymbol interference channels using multistage decoding,” IEEE Trans. Inf. Theory, vol. 53, no. 4, pp. 1416–1429, Apr. 2007

    work page 2007

  41. [41]

    Matched information rate codes for partial response channels,

    A. Kav ˇci´c, X. Ma, and N. Varnica, “Matched information rate codes for partial response channels,” IEEE Trans. Inf. Theory , vol. 51, no. 3, pp. 973–989, Mar. 2005

    work page 2005

  42. [42]

    The Gaussian wire-tap chan- nel,

    S. Leung-Yan-Cheong and M. Hellman, “The Gaussian wire-tap chan- nel,” IEEE Trans. Inf. Theory , vol. 24, no. 4, pp. 451–456, July 1978

    work page 1978

  43. [43]

    Non-systematic codes for physical layer security,

    M. Baldi, M. Bianchi, and F. Chiaraluce, “Non-systematic codes for physical layer security,” in Proc. IEEE Inf. Theory Workshop , Dublin, Ireland, Sept. 2010, pp. 1–5

    work page 2010

  44. [44]

    LDPC codes for the Gaussian wiretap channel,

    D. Klinc, J. Ha, S. W. McLaughlin, J. Barros, and B. J. Kwak, “LDPC codes for the Gaussian wiretap channel,” IEEE Trans. Inf. Forensics Secur., vol. 6, no. 3, pp. 532–540, Sept. 2011

    work page 2011

  45. [45]

    LDPC code design for the BPSK-constrained Gaussian wiretap channel,

    C. W. Wong, T. F. Wong, and J. M. Shea, “LDPC code design for the BPSK-constrained Gaussian wiretap channel,” in Proc. IEEE Glob. Commun. Conf., San Antonio, TX, USA, Dec. 2011, pp. 898–902

    work page 2011

  46. [46]

    Coding with scrambling, concatenation, and HARQ for the AWGN wire-tap channel: A security gap analysis,

    M. Baldi, M. Bianchi, and F. Chiaraluce, “Coding with scrambling, concatenation, and HARQ for the AWGN wire-tap channel: A security gap analysis,” IEEE Trans. Inf. Forensics Secur., vol. 7, no. 3, pp. 883– 894, June 2012. DRAFT 23

    work page 2012

  47. [47]

    Performance assessment and design of finite length LDPC codes for the Gaussian wiretap channel,

    M. Baldi, G. Ricciutelli, N. Maturo, and F. Chiaraluce, “Performance assessment and design of finite length LDPC codes for the Gaussian wiretap channel,” in Proc. IEEE Int. Conf. Commun., London, UK, June 2015, pp. 435–440

    work page 2015

  48. [48]

    On secure commu- nications over Gaussian wiretap channels via finite-length codes,

    A. Nooraiepour, S. R. Aghdam, and T. M. Duman, “On secure commu- nications over Gaussian wiretap channels via finite-length codes,” IEEE Commun. Lett., vol. 24, no. 9, pp. 1904–1908, Sept. 2020

    work page 1904

  49. [49]

    Finite state Markov wiretap channel with delayed feedback,

    B. Dai, Z. Ma, and Y . Luo, “Finite state Markov wiretap channel with delayed feedback,” IEEE Trans. Inf. Forensics Secur., vol. 12, no. 3, pp. 746–760, Mar. 2017

    work page 2017

  50. [50]

    Blind MIMO cooperative jamming: Secrecy via ISI heterogeneity without CSIT,

    J. de Dieu Mutangana and R. Tandon, “Blind MIMO cooperative jamming: Secrecy via ISI heterogeneity without CSIT,” IEEE Trans. Inf. Forensics Secur., vol. 15, pp. 447–461, June 2020

    work page 2020

  51. [51]

    Secrecy capacity of independent parallel channels,

    Z. Li, R. Yates, and W. Trappe, “Secrecy capacity of independent parallel channels,” in Securing Wireless Communications at the Physical Layer , R. Liu and W. Trappe, Eds. New York: Springer, 2009

    work page 2009

  52. [52]

    Secrecy capacity region of the degraded com- pound multi-receiver wiretap channel,

    E. Ekrem and S. Ulukus, “Secrecy capacity region of the degraded com- pound multi-receiver wiretap channel,” in Proc. 47th Annual Allerton Conf. Commun. Control and Computing , Monticello, IL, USA, Sept. 2009, pp. 1278–1285

    work page 2009

  53. [53]

    Wiretap channels with one-time state information: Strong secrecy,

    T. S. Han, H. Endo, and M. Sasaki, “Wiretap channels with one-time state information: Strong secrecy,” IEEE Trans. Inf. Forensics Secur. , vol. 13, no. 1, pp. 224–236, Jan. 2018

    work page 2018

  54. [54]

    Applications of LDPC codes to the wiretap channel,

    A. Thangaraj, S. Dihidar, A. R. Calderbank, S. W. McLaughlin, and J. M. Merolla, “Applications of LDPC codes to the wiretap channel,” IEEE Trans. Inf. Theory , vol. 53, no. 8, pp. 2933–2945, Aug. 2007

    work page 2007

  55. [55]

    C. B. Schlegel and L. C. Perez, Trellis and Turbo Coding: Iterative and Graph-Based Error Control Coding, 2nd Edition . Hoboken, NJ, USA: John Wiley & Sons, 2015

    work page 2015

  56. [56]

    Trellis coding for partial-response chan- nels,

    J. Wolf and G. Ungerboeck, “Trellis coding for partial-response chan- nels,” IEEE Trans. Commun. , vol. 34, no. 8, pp. 765–773, Aug. 1986

    work page 1986

  57. [57]

    Codes on graphs: Normal realizations,

    G. Forney, “Codes on graphs: Normal realizations,” IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 520–548, Feb. 2001

    work page 2001

  58. [58]

    A generalization of the Blahut-Arimoto algorithm to finite-state channels,

    P. O. V ontobel, A. Kav ˇci´c, D. M. Arnold, and H. A. Loeliger, “A generalization of the Blahut-Arimoto algorithm to finite-state channels,” IEEE Trans. Inf. Theory , vol. 54, no. 5, pp. 1887–1918, May 2008

    work page 1918

  59. [59]

    R. G. Gallager, Information Theory and Reliable Communication . New York, NY , USA: John Wiley & Sons, 1968

    work page 1968

  60. [60]

    Efficient encoding of low-density parity- check codes,

    T. Richardson and R. Urbanke, “Efficient encoding of low-density parity- check codes,” IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638–656, Feb. 2001

    work page 2001

  61. [61]

    Simulation-based computation of information rates for channels with memory,

    D. M. Arnold, H. A. Loeliger, P. O. V ontobel, A. Kav ˇci´c, and W. Zeng, “Simulation-based computation of information rates for channels with memory,” IEEE Trans. Inf. Theory, vol. 52, no. 8, pp. 3498–3508, Aug. 2006

    work page 2006

  62. [62]

    Algorithm for continuous decoding of turbo codes,

    S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, “Algorithm for continuous decoding of turbo codes,” Electron. Lett., vol. 32, no. 4, pp. 314–315, Feb. 1996

    work page 1996

  63. [63]

    The capacity of low-density parity- check codes under message-passing decoding,

    T. J. Richardson and R. L. Urbanke, “The capacity of low-density parity- check codes under message-passing decoding,” IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599–618, Feb. 2001

    work page 2001

  64. [64]

    On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit,

    S. Y . Chung, G. D. Forney, T. J. Richardson, and R. Urbanke, “On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit,” IEEE Commun. Lett. , vol. 5, no. 2, pp. 58–60, Feb. 2001

    work page 2001

  65. [65]

    Thresholds for turbo codes,

    T. Richardson and R. Urbanke, “Thresholds for turbo codes,” in Proc. IEEE Int. Symp. Inf. Theory , Sorrento, Italy, June 2000

    work page 2000

  66. [66]

    On the achievable information rates of finite state ISI channels,

    H. Pfister, J. Soriaga, and P. Siegel, “On the achievable information rates of finite state ISI channels,” in Proc. IEEE Glob. Commun. Conf. , San Antonio, TX, USA, Nov. 2001, pp. 2992–2996

    work page 2001

  67. [67]

    An explanation of ordinal optimization: Soft computing for hard problems,

    Y . C. Ho, “An explanation of ordinal optimization: Soft computing for hard problems,” Inf. Sci., vol. 113, no. 3, pp. 169–192, Mar. 1999

    work page 1999

  68. [68]

    A new multilevel coding method using error- correcting codes,

    H. Imai and S. Hirakawa, “A new multilevel coding method using error- correcting codes,” IEEE Trans. Inf. Theory, vol. 23, no. 3, pp. 371–377, May 1977

    work page 1977

  69. [69]

    TS 36.212 (V18.1.0): LTE; Evolved universal terrestrial radio access (E-UTRA); Multiplexing and channel coding (Release 18),

    3rd Generation Partnership Project (3GPP), “TS 36.212 (V18.1.0): LTE; Evolved universal terrestrial radio access (E-UTRA); Multiplexing and channel coding (Release 18),” 3GPP, Technical Specification 36.212, Jan. 2025

    work page 2025

  70. [70]

    TS 38.212 (V18.6.0): 5G; NR; Multiplexing and channel coding (Release 18),

    ——, “TS 38.212 (V18.6.0): 5G; NR; Multiplexing and channel coding (Release 18),” 3GPP, Technical Specification 38.212, Apr. 2025

    work page 2025

  71. [71]

    J. G. Proakis and M. Salehi, Digital Communications , 5th ed. New York, NY: McGraw-Hill Education, 2008

    work page 2008