Pith. sign in

REVIEW 5 major objections 3 minor 33 references

PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design

T0 review · 5 major / 3 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper proves a sufficient condition for bounded-complexity sequential decoding of PAC codes—per-chunk rates below the polarized cutoff rate give a Pareto-bound computation distribution—and turns it into a rate-profile design that…

desk verdict A real sufficient condition for Pareto-bounded sequential decoding of PAC codes, but the paper's unassisted-Fano claim is stronger than the genie-assisted theorem actually proves. read the letter →

arxiv 2412.06072 v2 pith:W22UCRTY submitted 2024-12-08 cs.IT cs.CCmath.IT

Mohsen Moradi , Hessam Mahdavifar This is my paper · ORCID
classification cs.ITcs.CCmath.IT MSC 94B3594A1594A24
keywords PACcodessequentialdecodingFanoalgorithmpolarchannelpolarizationcutoffrateParetodistributionprofiledesign
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper addresses the converse of an earlier necessary condition: it proves that when each chunk of a PAC code has a polarized rate below the corresponding polarized cutoff rate, the number of computations per decoded bit under sequential decoding has a Pareto upper tail. The proof works through the polarized branch metrics and bounds their moment-generating functions, then applies Wald's identity and a Minkowski-norm argument to control the Fano search. The result is a rate-profile design rule: place data bits only where the polarized rate sits below the polarized cutoff rate. Following that rule, the authors construct a PAC(1024,899) code whose Fano decoder outperforms 5G polar and LDPC codes by more than 0.75 dB at a frame error rate of $10^{-5}$, with per-bit visits near one at high SNR.

What carries the argument

The carrying objects are the polarized branch metric functions $\phi^{\{-,+\}^k}(\cdot)$ from metric polarization, which turn each polarized channel into a branch metric for the Fano decoder, together with a bias term $b$. Three lemmas bound the semi-invariant moment-generating functions of these metrics on correct paths, wrong paths, and their differences in terms of Gallager's $E_0$ function, the channel's error-exponent function; these feed a Wald's-identity argument that controls the minimum correct-path metric and a Chernoff-bound argument that controls how far wrong paths can get. A Minkowski-norm argument lifts the expected-computation bound to a bound on the $\beta$-th moment, and the generalized Chebyshev inequality turns that into the Pareto tail. The free threshold spacing $\Delta$ is set to $\beta/r$ to optimize the constant, matching the conventional $\Delta=2$ for $r=1/2$, $\beta=1$.

What would settle it

Run a real Fano decoder without a genie on a PAC(1024,899) code designed by this paper's rate-profile rule at an $E_b/N_0$ where the first-chunk frame error rate is around $10^{-2}$; if the measured tail $P(C_n \geq L)$ decays slower than the Pareto bound or the average visits start growing with block length, the genie assumption is doing essential work.

Watch

Extended reading notes

Core claim

The central claim is Theorem 5: for any chunk of the decoding tree after $k$ polarization steps, if the chunk's rate satisfies $R^{\{-,+\}^k}_l \leq \frac{r}{\beta}\left(E_0\left(\frac{1-r}{r}, W^{\{-,+\}^k}\right) + b^{\{-,+\}^k}\right) - \epsilon$ and the bias satisfies $b^{\{-,+\}^k} \leq E_0(\delta, W^{\{-,+\}^k})/\delta$ for some $0<\delta<1$, then $P(C^{\{-,+\}^k}_n \geq L) \leq \left(\frac{4}{L(1-2^{-\epsilon/\beta})^2}\right)^\beta$. With $r=1/2$ and $\beta=1$, this becomes the polarized cutoff-rate condition $R \leq E_0(1,W) - \epsilon = R_0 - \epsilon$. So staying below the polarized cutoff rate is not just necessary (as earlier work showed exponential growth above it) but sufficient for a Pareto-bounded computation distribution. The same argument recurses over the polarization transform, and the authors use it as a constructive rate-profile guideline.

Load-bearing premise

The proof for the second half and deeper chunks assumes a genie has already decoded the earlier chunks correctly, so an unassisted Fano decoder's errors in one chunk could propagate into later chunks in ways this argument does not bound.

Editorial extensions

If this is right

  • The polarized cutoff rate becomes the design threshold: rate profiles that allocate data bits to positions whose polarized rate is below $R_0^{\{-,+\}^k}$ are guaranteed a Pareto-bounded computation distribution per bit.
  • The construction algorithm starts from an RM(1024,968) code, freezes data bits until the polarized cutoff-rate constraints hold at a target $E_b/N_0$, and then freezes last weight-8 rows; the resulting PAC(1024,899) code gains more than 0.75 dB over 5G polar and LDPC codes at FER $10^{-5}$.
  • At high SNR the average number of node visits per decoded bit approaches 1, so the Fano decoder's complexity stays within about a factor of two of plain successive cancellation decoding.
  • With more polarization steps the average polarized cutoff rate moves toward capacity, so the same Pareto bound allows Fano decoding to operate closer to capacity while retaining bounded complexity.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The genie assumption means the theorem proves a conditional per-chunk guarantee; extending it to an unassisted Fano decoder likely requires controlling the probability that an earlier chunk is wrong, perhaps with a union bound over chunk error events.
  • The Pareto exponent $\beta$ is tied to the slack $\epsilon$ through $(1-2^{-\epsilon/\beta})^{-2\beta}$; measuring the actual tail exponent per chunk in simulation could show whether deeper polarization produces heavier or lighter tails than this bound.
  • The design choice to freeze the last weight-8 rows is analogous to zero-padding termination in convolutional codes; the paper notes it improves FER but leaves it for further study, so a direct comparison of freezing different weight-8 rows would test whether the position effect is real.
  • Because polarized cutoff rates polarize to capacity, the same sufficient condition suggests that capacity-approaching PAC rate profiles could still be decoded sequentially with Pareto-bounded complexity for large block lengths.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 3 minor

Summary. This paper studies the computational complexity of Fano sequential decoding of PAC codes. The authors derive upper bounds on the moments of the number of decoder computations per bit for one-step and multi-step polarized channels, under a rate-profile condition that each chunk's polarized rate lies below the corresponding polarized cutoff rate minus a slack epsilon. The main result, Theorem 5, states that under these conditions the complementary CDF of the number of computations for the nth bit of a chunk is bounded by a Pareto tail of the form (4/(L(1-2^{-epsilon/beta})^2))^beta. The authors then propose a rate-profile design based on freezing bits of an RM code to satisfy the cutoff-rate constraints, and present simulations for (1024,899), (512,460), and (128,85) PAC codes showing FER improvements over 5G polar, LDPC, and FDPC codes.

Significance. If fully established, the result would provide a converse to the necessary-condition result of [18] and a principled rate-profile design rule for PAC codes with bounded-complexity sequential decoding. The paper re-derives the key MGF bounds in a largely self-contained manner, states explicit Pareto bounds, and demonstrates nontrivial coding gains in simulation. However, the central claim as stated is stronger than what is proved: the theorem on which the recursive design relies is explicitly genie-assisted and its proof for general k is omitted. The independence assumption underlying Wald's identity is asserted without proof, and there are mismatches between the statements and proofs of the main theorems. These gaps need to be addressed before the result can be accepted as stated.

major comments (5)
  1. [Section III, Theorem 5 (Eq. (69)-(70)) and abstract/conclusion] The theorem is stated for a genie-assisted decoder: 'Assume that, with the help of a genie, the previous chunks of the decoding tree ... have been decoded.' The abstract and Section V state the result for 'its sequential decoding' without this qualifier. For an actual Fano decoder, an error in an earlier chunk can send the search into incorrect subtrees of later chunks, and the branch-metric statistics in those subtrees are not those used in the genie-assisted proof. The paper does not provide the standard removal of the genie by summing per-chunk bounds over all correct nodes of the full tree, which would require a rate-profile condition at every node rather than only at chunk level. Please either prove the unassisted statement or revise the claims to state the genie-assisted version explicitly.
  2. [Section III, Theorem 5 proof] The proof for the multi-step polarization case (and even for the second half, Theorem 4) is omitted: before Theorem 4 the text says 'Similarly, we can prove,' and Theorem 5 is stated without proof. The extension to k>1 is not immediate, because the branch metrics of deeper polarized channels condition on the earlier decoded bits, and the dependence structure across chunks must be handled. Since Theorem 5 is the basis for the rate-profile design rule used in Section IV (k=7 for N=1024 and k=6 for N=512), the proof needs to be provided.
  3. [Section III, after Eq. (7), and Lemmas 4-5] The assertion 'gamma^-(S_i) independent of gamma^-(S_j)' is stated without proof. Wald's identity in Lemma 4 and the factorization in Lemma 5 require independence (or at least uncorrelatedness for the MGF product). While this is likely true in the random-coding ensemble under conditioning on the transmitted path, it should be proven or clearly referenced. Without it, the bound on P(Gamma^-_min <= mu) and the subsequent moment bounds are not supported.
  4. [Theorems 3 and 5, Eq. (56)-(57) and Eq. (69)-(70)] There is a mismatch between the stated sufficient condition and the bound proved. The condition R^-_l <= (r/beta)(E0((1-r)/r,W^-)+b^-) - epsilon leads, in the proof (Eq. (60)), to a factor (1-2^{-epsilon})^{-2} in the moment bound, so the final Pareto bound should be (4/(L(1-2^{-epsilon})^2))^beta. The theorem instead states (4/(L(1-2^{-epsilon/beta})^2))^beta. Either the condition should be R^-_l <= (r/beta)(E0+b) - epsilon/beta, or the bound should use epsilon. The same issue appears in Theorem 5.
  5. [Lemmas 3-4, bias condition] The condition b^- <= E0(delta,W^-)/delta for 0<delta<1 is inconsistent with the stated ranges r in (0,1) and r0 in (-1,0). In Lemma 3's proof, delta = r/(1-r) lies in (0,infinity) for r in (0,1); the equivalence with delta<1 only holds for r<1/2. Similarly, in Lemma 4, delta = -r0/(1+r0) is <1 only for r0>-1/2. The special cases r=1/2 and r0=-1/2 used in the paper give delta=1, which is outside the stated range. Please correct the parameter ranges or extend the proofs to cover the claimed ranges.
minor comments (3)
  1. [Eq. (30)] Equation (30) contains typographical artifacts (the crossed-out 'P' terms) that should be removed in revision.
  2. [Lemma 6 proof] The phrase 'the first inequality is an application of Wald's identity' is misleading; the referenced inequality P(inf Gamma <= mu) <= 2^{-r0 mu} is Lemma 4, not Wald's identity directly.
  3. [Section IV, rate-profile design] The design choice to freeze the last weight-8 rows is presented as a guess ('We guess that freezing the bits corresponding to the last rows enhances the upper bound...'). This is acceptable as a heuristic, but it would be clearer to label it explicitly as an empirical design choice that requires further investigation.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the Pareto bound is derived from stated rate-profile hypotheses via self-contained MGF/Chernoff/Wald arguments, and self-citations are contextual rather than load-bearing.

full rationale

The paper's core derivation is self-contained. Lemmas 1-3 derive the relevant semi-invariant MGF bounds with all intermediate steps shown, so the citation to [27] is only for the proof approach, not as an unverified load-bearing premise. The polarized metric functions are imported from [8], but they are explicit definitions, and the subsequently used inequalities are proved in the text rather than assumed from [8]. The rate-profile condition (69) is a hypothesis under which the sums over incorrect subtrees converge; the Pareto tail bound is then obtained via Minkowski, Chernoff, Wald, and Chebyshev arguments, not by restating the hypothesis. The prior-work necessary condition in [18] is used only to frame the result as a converse, not to prove Theorem 5. The paper does contain two non-circular gaps that should weigh in a correctness review: (i) Theorem 4 and Theorem 5 are stated with 'Similarly, we can prove', so the generalization to k>1 polarization steps is asserted, not demonstrated; and (ii) the theorems are proved under a genie-assisted assumption ('with the help of a genie, the previous chunks... have been decoded'), while the abstract and conclusion claim unqualified behavior of 'its sequential decoding'. The asserted independence gamma-(S_i) perp gamma-(S_j) is also unproved. These are omitted-support and scope issues, not instances where an output reduces by construction to an input; hence the circularity score is 0.

Assumptions & free parameters 8 free parameters · 5 assumptions · 0 invented entities

The central claim depends on the random-coding ensemble, on an asserted independence of branch metrics across positions, and on a genie supplying correct earlier bits for later chunks. No new physical or mathematical entities are postulated. The free parameters are proof/design degrees of freedom: bias terms, threshold spacing, exponents r and beta, slack epsilon, and the target-SNR and polarization-step choices used in the numerical rate-profile construction.

free parameters (8)
  • Fano metric bias terms b^- and b^+ = not numerically specified
    Used in branch metric definitions (1), (3), (6)-(7). Theorems require b <= E0(delta,W)/delta for 0<delta<1; the numerical bias values are not reported.
  • Threshold spacing Delta = Delta=2 for unbounded search; Delta=6.5 for bounded search
    Chosen by hand. Delta=1/r (or beta/r) minimizes the theoretical bound; simulations use Delta=2 as suggested by [7] and Delta=6.5 for bounded search.
  • Rate condition exponent r = r=1/2 in the simplified design rule
    Free parameter in (0,1) in rate conditions (50), (56), (69); simplified to r=1/2 for the design rule.
  • Pareto exponent beta = beta>1; not specified in simulations
    Free exponent in Chebyshev tail bounds (57), (66), (70).
  • Slack epsilon = positive; exact value not given
    Needed for convergence of sums over tree depth; any epsilon>0 suffices.
  • Design target Eb/N0 = 3.6 dB for PAC(1024,899), 4.5 dB for PAC(512,460), 3 dB for PAC(128,85)
    Chosen by hand to tune the number of bits frozen by the cutoff-rate constraint so the code rate matches the target K/N.
  • Polarization step k = 7 for N=1024, 6 for N=512, 4 for N=128
    Design choice for chunk size 2^{n-k}=8 in all numerical examples.
  • Extra frozen weight-8 rows = 10 for (1024,899), 1 for (512,460), 10 for (128,85)
    Heuristic: freeze rows at the bottom of the generator matrix to improve FER; the paper says this requires further investigation.
assumptions (5)
  • domain assumption Standard random linear convolutional-code ensemble (T,c) with u=vT+c, averaged over data, noise, and code ensemble
    Used at the start of Section III to enable MGF computations; standard in sequential decoding analysis [24].
  • domain assumption Branch metrics for different positions are independent: gamma-(Si) independent of gamma-(Sj) and gamma+(Si) independent of gamma+(Sj)
    Stated in Section III before Lemma 5 and before Theorem 4; needed for Wald's identity and product MGFs.
  • domain assumption A genie supplies correct earlier bits when decoding later chunks
    Explicit in the proofs of Theorem 4 and Theorem 5; without the genie, the unconditional Pareto bound for a real Fano decoder is not established.
  • standard math Wald's identity applies to Gamma^-_min with an absorbing barrier
    Invoked in Lemma 4 and Lemma 6 via [28, p.434].
  • standard math Gallager E0 function and Chernoff bound hold for binary-input DMCs
    Used throughout Lemmas 1-3 and Theorem 1.

how reviews work

0 comments
Cite this review

Pith. "Pith review of PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design." pith.science (2026). https://pith.science/paper/W22UCRTY

@misc{pith2026241206072,
  author       = {Pith},
  title        = {Pith review of: PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/W22UCRTY}},
  note         = {Machine review of arXiv:2412.06072}
}
abstract

Recently, a novel variation of polar codes known as polarization-adjusted convolutional (PAC) codes has been introduced by Ar{\i}kan. These codes significantly outperform conventional polar and convolutional codes, particularly for short codeword lengths, and are shown to operate very close to the optimal bounds. It has also been shown that if the rate profile of PAC codes does not adhere to certain polarized cutoff rate constraints, the computation complexity for their sequential decoding grows exponentially. In this paper, we address the converse problem, demonstrating that if the rate profile of a PAC code follows the polarized cutoff rate constraints, the required computations for its sequential decoding can be bounded with a distribution that follows a Pareto distribution. This serves as a guideline for the rate-profile design of PAC codes. For a high-rate PAC\,$(1024,899)$ code, simulation results show that the PAC code with Fano decoder, when constructed based on the polarized cutoff rate constraints, achieves a coding gain of more than $0.75$ dB at a frame error rate (FER) of $10^{-5}$ compared to the state-of-the-art 5G polar and LDPC codes.

Figures

Figures reproduced from arXiv: 2412.06072 by the authors.

Figure 1
Figure 1. Flowchart of PAC coding scheme. follow the polarized cutoff rates was established as a necessary condition for bounded-complexity sequential decoding of PAC codes [18]. In this paper, we address the converse problem of [18] by leveraging the metric polarization introduced in [8]. More specifically, we characterize sufficient conditions on the PAC code rate profile to ensure a finite upper bound on the distri￾bution … view at source ↗
Figure 2
Figure 2. Correct path, wrong path, and incorrect subsets on code tree. [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 4
Figure 4. Code tree of PAC codes after one-step polarization. [PITH_FULL_IMAGE:figures/full_fig_p003_4.png] view at source ↗
Figures from the paper (5 more)
Figure 3
Figure 3. Figure 3: Flowchart of a one-step polarization scheme. [PITH_FULL_IMAGE:figures/full_fig_p003_3.png]
Figure 5
Figure 5. Figure 5: shows a typical behaviour of the semi-invariant MGF h −(r). Because P (γ −(Si) > 0) > 0 and P (γ −(Si) < 0) > 0, obviously we can see that h −(r) −→ ∞ from both sides. We are now equipped to use Wald’s identity [28, p. 434] to conclude the proof [PITH_FULL_IMAGE:figur…
Figure 6
Figure 6. Figure 6: FER performance comparison of PAC, polar, LDPC, and FDPC codes [PITH_FULL_IMAGE:figures/full_fig_p010_6.png]
Figure 7
Figure 7. Figure 7: Complexity performance comparison of PAC and CRC-aided polar [PITH_FULL_IMAGE:figures/full_fig_p011_7.png]
Figure 9
Figure 9. Figure 9: Performance comparison of the PAC(128, 85) codes with Fano decoding algorithms with different rate profiles. the generator matrix with weight 8 of the resulting (128, 95) code, to construct a PAC(128, 85) code. In this figure, we also plot the performance of the Fano d…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

33 extracted references · 28 canonical work pages

  1. [18]

    Application of guessing to sequential decoding of polarization-adjusted convolutional (PAC) codes,

    M. Moradi, “Application of guessing to sequential decoding of polarization-adjusted convolutional (PAC) codes,”IEEE Transactions on Communications, vol. 71, no. 8, pp. 4425–4436, 2023

    work page 2023

  2. [1]

    From sequential decoding to channel polarization and back again,

    E. Arıkan, “From sequential decoding to channel polarization and back again,” 2019. [Online]. Available: https://arxiv.org/abs/1908.09594

    arXiv 2019

  3. [2]

    Performance and Complexity of Sequential Decoding of PAC Codes

    M. Moradi, A. Mozammel, K. Qin, and E. Arıkan, “Performance and complexity of sequential decoding of PAC codes,” 2020. [Online]. Available: https://arxiv.org/abs/2012.04990

    work page Pith review arXiv 2020

  4. [3]

    Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,

    E. Arıkan, “Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,”IEEE Transactions on Information Theory , vol. 55, no. 7, pp. 3051–3073, 2009

    work page 2009

  5. [4]

    Sequential decoding for reliable communication,

    J. M. Wozencraft, “Sequential decoding for reliable communication,” Research Laboratory of Electronics, MIT, Cambridge, Tech. Rep. 325, 1957

    work page 1957

  6. [5]

    A heuristic discussion of probabilistic decoding,

    R. Fano, “A heuristic discussion of probabilistic decoding,” IEEE Transactions on Information Theory , vol. 9, no. 2, pp. 64–74, 1963

    work page 1963

  7. [6]

    Variable-length codes and the Fano metric,

    J. Massey, “Variable-length codes and the Fano metric,” IEEE Transac- tions on Information Theory , vol. 18, no. 1, pp. 196–198, 1972

    work page 1972

  8. [7]

    On sequential decoding metric function of polarization- adjusted convolutional (PAC) codes,

    M. Moradi, “On sequential decoding metric function of polarization- adjusted convolutional (PAC) codes,” IEEE Transactions on Communi- cations, vol. 69, no. 12, pp. 7913–7922, 2021

    work page 2021

Show all 33 references
  1. [8]

    On fast SC-based polar decoders: Metric polarization and a pruning technique,

    M. Moradi and H. Mahdavifar, “On fast SC-based polar decoders: Metric polarization and a pruning technique,” 2024. [Online]. Available: https://arxiv.org/abs/2408.03840

    2024 arXiv

  2. [9]

    Stack decoding of polar codes,

    K. Niu and K. Chen, “Stack decoding of polar codes,” Electronics letters, vol. 48, no. 12, pp. 695–697, 2012

    2012

  3. [10]

    Sequential decoding of polar codes,

    V . Miloslavskaya and P. Trifonov, “Sequential decoding of polar codes,” IEEE Communications Letters , vol. 18, no. 7, pp. 1127–1130, 2014

    2014

  4. [11]

    A score function for sequential decoding of polar codes,

    P. Trifonov, “A score function for sequential decoding of polar codes,” in 2018 IEEE International Symposium on Information Theory (ISIT) , 2018, pp. 1470–1474

    2018

  5. [12]

    List decoding of Arıkan’s PAC codes,

    H. Yao, A. Fazeli, and A. Vardy, “List decoding of Arıkan’s PAC codes,” Entropy, vol. 23, no. 7, p. 841, 2021

    2021

  6. [13]

    Polarization-adjusted con- volutional (PAC) codes: Sequential decoding vs list decoding,

    M. Rowshan, A. Burg, and E. Viterbo, “Polarization-adjusted con- volutional (PAC) codes: Sequential decoding vs list decoding,” IEEE Transactions on Vehicular Technology , vol. 70, no. 2, pp. 1434–1447, 2021

    2021

  7. [14]

    Approximate weight distribution of polarization-adjusted convolutional (PAC) codes,

    S. Seyedmasoumian and T. M. Duman, “Approximate weight distribution of polarization-adjusted convolutional (PAC) codes,” in 2022 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2022, pp. 2577–2582

    2022

  8. [15]

    On the minimum weight codewords of PAC codes: The impact of pre-transformation,

    M. Rowshan and J. Yuan, “On the minimum weight codewords of PAC codes: The impact of pre-transformation,” IEEE Journal on Selected Areas in Information Theory , 2023

    2023

  9. [16]

    Soft-decision decoding of Reed-Muller codes: recursive lists,

    I. Dumer and K. Shabunov, “Soft-decision decoding of Reed-Muller codes: recursive lists,” IEEE Transactions on Information Theory , vol. 52, no. 3, pp. 1260–1266, 2006

    2006

  10. [17]

    A RM-polar codes,

    B. Li, H. Shen, and D. Tse, “A RM-polar codes,” arXiv preprint arXiv:1407.5483, 2014

    2014 arXiv

  11. [19]

    Design of compactly specified polar codes with dynamic frozen bits based on reinforcement learning,

    V . Miloslavskaya, Y . Li, and B. Vucetic, “Design of compactly specified polar codes with dynamic frozen bits based on reinforcement learning,” IEEE Transactions on Communications , vol. 72, no. 3, pp. 1257–1272, 2024

    2024

  12. [20]

    Polar codes with dynamic frozen symbols and their decoding by directed search,

    P. Trifonov and V . Miloslavskaya, “Polar codes with dynamic frozen symbols and their decoding by directed search,” in 2013 IEEE Informa- tion Theory Workshop (ITW) , 2013, pp. 1–5

    2013

  13. [21]

    On the road to 6G: Visions, requirements, key technologies, and testbeds,

    C.-X. Wang, X. You, X. Gao, X. Zhu, Z. Li, C. Zhang, H. Wang, Y . Huang, Y . Chen, H. Haas et al. , “On the road to 6G: Visions, requirements, key technologies, and testbeds,” IEEE Communications Surveys & Tutorials, vol. 25, no. 2, pp. 905–974, 2023

    2023

  14. [22]

    The computation problem with sequential decoding

    J. E. Savage, “The computation problem with sequential decoding.” Ph.D. dissertation, ept. of Elec. Engrg., Massachusetts Institute of Technology, Cambridge, February 1965

    1965

  15. [23]

    I. M. Jacobs and J. Wozencraft, Principles of communication engineer- ing. New York: John Wiley and Sons, 1965

    1965

  16. [24]

    R. G. Gallager, Information theory and reliable communication . New York: Wiley, 1968, vol. 2

    1968

  17. [25]

    An inequality on guessing and its application to sequential decoding,

    E. Arıkan, “An inequality on guessing and its application to sequential decoding,” IEEE Transactions on Information Theory , vol. 42, no. 1, pp. 99–105, 1996

    1996

  18. [26]

    Hardware implementation of Fano decoder for polarization-adjusted convolutional (PAC) codes,

    A. Mozammel, “Hardware implementation of Fano decoder for polarization-adjusted convolutional (PAC) codes,”IEEE Transactions on Circuits and Systems II: Express Briefs , vol. 69, no. 3, pp. 1632–1636, 2022

    2022

  19. [27]

    A tree pruning technique for decoding complexity reduction of polar codes and PAC codes,

    M. Moradi and A. Mozammel, “A tree pruning technique for decoding complexity reduction of polar codes and PAC codes,”IEEE Transactions on Communications, vol. 71, no. 5, pp. 2576–2586, 2023

    2023

  20. [28]

    R. G. Gallager, Stochastic Processes: Theory for Applications . Cam- bridge University Press, 2013

    2013

  21. [29]

    An information-theoretic perspective on successive cancellation list decoding and polar code design,

    M. C. Cos ¸kun and H. D. Pfıster, “An information-theoretic perspective on successive cancellation list decoding and polar code design,” IEEE Transactions on Information Theory , vol. 68, no. 9, pp. 5779–5791, 2022

    2022

  22. [30]

    High-rate fair-density parity-check codes,

    H. Mahdavifar, “High-rate fair-density parity-check codes,” 2024. [Online]. Available: https://arxiv.org/abs/2402.06814

    2024 arXiv

  23. [31]

    On the high-rate FDPC codes: Construction, encoding, and a generalization,

    M. Moradi, S. Rabeti, and H. Mahdavifar, “On the high-rate FDPC codes: Construction, encoding, and a generalization,” 2025. [Online]. Available: https://arxiv.org/abs/2506.11345

    2025 arXiv

  24. [32]

    A weighted sum based construction of pac codes,

    W. Liu, L. Chen, and X. Liu, “A weighted sum based construction of pac codes,” IEEE Communications Letters , vol. 27, no. 1, pp. 28–31, 2023

    2023

  25. [33]

    Construction of pac codes with list- search and path-splitting critical sets,

    S. Jiang, J. Wang, C. Xia, and X. Li, “Construction of pac codes with list- search and path-splitting critical sets,” arXiv preprint arXiv:2304.11554, 2023

    2023 arXiv

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.