Pith. sign in

REVIEW 4 major objections 6 minor 50 references

Polarized Element-pair Code Based FFMA over a Gaussian Multiple-access Channel

T0 review · 4 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read This paper proposes polarized element-pair (EP) codes for finite-field multiple-access (FFMA) over a Gaussian multiple-access channel, derives a two-section capacity formula, and reports a 1.25 dB BER gain over polar random spreading for…

desk verdict Interesting FFMA-polar construction, but the headline 1.25 dB gain rests on an internally inconsistent normalization that must be fixed before the claim is credible. read the letter →

arxiv 2506.06796 v1 pith:LXTFVRTD submitted 2025-06-07 cs.IT math.IT

Zhang-li-han Liu , Qi-yue Yu This is my paper
classification cs.ITmath.IT
keywords polarizedelement-paircodefinite-fieldmultipleaccessGaussianmultiple-accesschannelpolarizationsuccessivecancellationlistdecodingtopLbifurcatedminimumdistancepowerallocationfiniteblocklength
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

The paper seeks to establish that the finite-blocklength multiuser coding problem can be solved by a polar-style code built for the Gaussian multiple-access channel rather than for a single-user link. The authors construct polarized element-pair (EP) codes, which treat pairs of field elements as virtual resources that separate users, and place them inside the finite-field multiple-access (FFMA) architecture, where multiuser signals are superimposed before decoding. They derive a capacity formula for the resulting system, design a Monte Carlo construction of the polarized index set and an optimal power split, and propose two decoders: an SCL decoder for larger payloads and a TopL-BMD decoder for small payloads. Simulations for 15 users at 32 bits per user show a BER of $10^{-5}$ at about 1.25 dB lower $E_b/N_0$ than the polar random spreading baseline, which is the concrete claim the paper rises or falls on.

What carries the argument

The load-bearing object is the polarized element-pair (EP) code: the Cartesian product of $M$ element pairs $C_j=(0,\alpha^{l_{j,1}})$, where each $\alpha^{l_{j,1}}$ is a row of the $\kappa$-fold Kronecker matrix $G^{(\kappa)}$ over $\mathrm{GF}(2^m)$. A systematic-form generator separates each user's codeword into an information section of length $M=JK$ and a parity section of length $R=m-M$, which lets the transmitter allocate different power to the two sections via $\mu_{\mathrm{inf}}$ and $\mu_{\mathrm{red}}$. The receiver treats the superimposed signal as a codeword of this EP code; the paper's capacity analysis models the channel as a cascade, and the construction uses a Monte Carlo calculation of polarized subchannel capacities to pick the index set $\mathcal{A}$ and the power ratio $\mu_{\mathrm{pas}}=\mu_{\mathrm{inf}}/\mu_{\mathrm{red}}$. Two decoders carry the argument: SCL with a path metric, and TopL-BMD, which uses a min-heap to find the $L$ most probable flip sets and then minimum-distance re-encoding.

What would settle it

Reproduce the $J=15$, $K=32$ simulation with the exact parameters reported ($m=1024$, $M=992$, CRC length 8, $L=512$): if TopL-BMD does not reach BER $10^{-5}$ about 1.25 dB below the polar random spreading baseline, the central gain claim fails; a second check is whether a fixed power allocation reproduces the same BER, which would show the optimized power split is not load-bearing.

Watch

Extended reading notes

Core claim

The central claim is that a systematic polarized EP code, built from selected rows of the Kronecker generator matrix over $\mathrm{GF}(2^m)$ and split into an information section and a parity section, makes FFMA operate effectively over the GMAC at finite blocklength. The paper decomposes the GMAC into a binary-input approximate-symmetric channel followed by a multiple-input non-symmetric channel, and expresses the total capacity as $C_{\mathrm{tot}}=\frac{JK}{2}\log_2(1+\mu_{\mathrm{inf}}P_{\mathrm{avg}}/\sigma^2)+\frac{R}{2}\log_2(1+J\mu_{\mathrm{red}}P_{\mathrm{avg}}/\sigma^2)$, with $\mu_{\mathrm{inf}}$ and $\mu_{\mathrm{red}}$ as polarization-adjusted power factors obeying $mP_{\mathrm{avg}}=K\mu_{\mathrm{inf}}P_{\mathrm{avg}}+R\mu_{\mathrm{red}}P_{\mathrm{avg}}$. With that construction, the paper reports that the SCL decoder reaches BER $10^{-5}$ about 1.25 dB lower in $E_b/N_0$ than polar random spreading for 15 users and $K=32$, and that the TopL-BMD decoder gives comparable performance for small payloads.

Load-bearing premise

The code construction and power split are chosen using idealized successive-cancellation analysis and a capacity proxy, and the results assume those choices remain near-optimal for the practical SCL and TopL-BMD decoders at the finite blocklengths simulated.

Editorial extensions

If this is right

  • For $K=64$ and SCL decoding, the PA-FFMA system beats polar random spreading by about 1.5 dB at $J=5$, 2.5 dB at $J=10$, and keeps functioning at $J=15$ where the baseline fails to reach BER $10^{-5}$.
  • For $K=32$, TopL-BMD slightly outperforms SCL at small user counts and delivers the headline 1.25 dB gain at $J=15$ over polar random spreading.
  • The SCL decoder's complexity is $O(JR + Lm\log m)$, independent of the number of users except in the LLR calculation, and is lower than the iterative SIC-based polar spreading baseline.
  • The optimal power allocation shifts more power to the parity section as $E_b/N_0$ or the user count grows, because the parity-section capacity then dominates the information-section capacity.
  • The system still functions at $J=31$ users with $K=32$, where the polar random spreading baseline fails to reach a BER of $10^{-5}$.

Reading between the lines

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

  • The capacity formula implies per-user capacity grows only logarithmically in $J$, so the reported 1.25 dB gain is not predicted to persist at much larger user counts; a natural test is to run the same comparison at $J=50$ or $J=100$.
  • The Monte Carlo construction could be swapped for a deterministic partial-order construction to test whether the index set, rather than the FFMA structure, is what produces the reported gain.
  • The same EP-code machinery could be tried with LDPC or BCH inner codes to isolate the polarization contribution from the finite-field multiplexing contribution.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 6 minor

Summary. The paper proposes a polarized element-pair (EP) code for finite-field multiple-access (FFMA) systems over a Gaussian multiple-access channel (GMAC). A systematic encoder partitions the codeword into information and parity sections, a capacity expression (Eq. 28) is used to justify power allocation, and two decoders are introduced (SCL for balanced payloads and TopL-BMD for small payloads). The central claimed result is a BER gain over polar random spreading, e.g., 1.25 dB at BER 10^-5 for J=15, K=32 with m=1024, M=992, CRC=8, L=512 (Section VI.B). The main evidence is simulation, with parameters described in Section VI.

Significance. If the reported gains survive a consistent normalization, the paper offers a practical finite-blocklength multiuser coding scheme with lower decoding complexity than the polar random spreading baseline; the TopL-BMD decoder is an interesting and potentially useful algorithmic contribution. The manuscript specifies concrete simulation parameters and makes falsifiable BER predictions, which is a strength. However, the analytical support is weak: the capacity formula is cited from the authors' earlier work, the power normalization is internally inconsistent, and the code construction depends on an ideal-SC Monte Carlo proxy whose transfer to the actual decoders is not validated. The significance therefore hinges on whether the simulation claims can be reproduced under a corrected power/rate budget.

major comments (4)
  1. [Section II.D vs. Section VI.B] Section II.D defines the systematic information section by M = K × J, but Section VI.B sets m = 1024, K = 32, M = 992, and R = 32 for J = 5, 15, and 31. Only J = 31 satisfies M = J K; for J = 15, J K = 480, so either the systematic encoder should use M = 480 and R = 544, or the 512 positions beyond J K are frozen zeros whose status in the rate and power budgets is never specified. Because Eb/N0 and the claimed 1.25 dB gain depend on the energy per information bit and on the number of active positions, the simulation results in Fig. 9 are not reproducible as written.
  2. [Eq. (15) vs. Eq. (28)] Equation (15) states m P_avg = K μ_inf P_avg + R μ_red P_avg and calls this 'total transmit power', but the capacity expression in Eq. (28) counts J K information symbols and an R-symbol parity section with J-user superposition. If Eq. (15) is a per-user constraint, the phrase 'total transmit power' is wrong and the comparison to polar spreading (which transmits all J users over the same m degrees of freedom) needs an explicit total-power normalization; if it is a total-power constraint, a factor J is missing from the right-hand side. Either way, the Monte Carlo search for μ_pas in Section VI.A and the resulting BER curves in Figs. 8 and 9 are not tied to a well-defined power budget.
  3. [Section IV.A.3, Eq. (28)] The abstract and contribution list claim a derivation of the channel capacity, but Eq. (28) is quoted from the authors' earlier preprint [42]; the surrounding derivation is not a proof (the BI-ASC capacity in Eq. (22) is a BSC approximation and Eq. (27) is an asymptotic limit). Since the code construction in Section IV.B and the optimal power allocation in Section VI.A are both keyed to Eq. (28), the paper's analytical claims should be either re-derived here or explicitly presented as inherited from [42] with its assumptions restated.
  4. [Sections IV.B and VI] Section IV.B constructs the polarized index set A by Monte Carlo capacities of an ideal SC decoder, but the systems evaluated in Section VI use SCL and TopL-BMD decoders. The paper provides no finite-blocklength evidence, beyond the final BER curves, that the index set and μ_pas selected under the ideal-SC proxy remain near-optimal for the actual decoders; this is a load-bearing premise for the reported gains, and a sensitivity analysis (e.g., comparing constructions designed for each decoder) is needed.
minor comments (6)
  1. [Throughout] The manuscript contains many typos and spelling errors ('ogranized', 'polaried', 'virous', 'matrx', 'Krnonecker', 'Capactiy', 'Suppse', 'blcok', 'anlayze'); a careful proofreading pass is required.
  2. [Eq. (22)] The notation 'arg max p(y_i)' is undefined and appears twice; the capacity should be maximized over the input distribution, not the output distribution.
  3. [Lemma 1, Eq. (31)] The product formula for P(w = ŵ | y) assumes independent bit posteriors and does not account for the CRC or the code structure; the notation uses M in the product while w has length J K. Please clarify the derivation or state the independence assumption explicitly.
  4. [Section VI.B] The text says 'which is half of the payload in Fig. 9' when discussing the K = 32 results, but the preceding paragraph for K = 64 references Fig. 8; the figure numbering and cross-references should be reconciled.
  5. [Abstract and body] The 'Marto Loco method' mentioned in the abstract is not defined or referenced in the body; please give the formal name and a citation, or remove the term.
  6. [Section VI.B] The baseline description specifies 'random Gaussian spreading sequences' but does not provide a seed or a precise MMSE-SCL-SIC implementation; please add enough detail (or a pseudo-code block) to make the comparison reproducible.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the BER-gain claim is tested against an external baseline, and the self-cited capacity formula is independent standard material rather than a fitted input.

full rationale

The paper's central performance claim is the BER comparison against the polar random spreading baseline [15] in Section VI.B, which is an external, independently defined benchmark. The reported 1.25 dB gain for J=15, K=32 comes from BER simulation curves at an optimized power allocation, not from reinserting the same quantity that was fitted. The power allocation factor μ_pas is selected by Monte Carlo maximization of the capacity expression in Eq. (28), and is then used as a fixed parameter in a separate BER simulation; this is a standard design-optimization step, not a fitted value renamed as a prediction. The capacity formula itself, Eq. (28), is attributed to the same-author preprint [42], but it is a closed-form sum of the AWGN information-section capacity and the J-user GMAC parity-section capacity, with stated structural assumptions and externally checkable information-theoretic content; it is not defined in terms of the BER result it is used to generate. The code construction in Section IV.B uses Monte Carlo evaluation with the standard Tal-Vardy capacity formula Eq. (29) and an ideal SC decoder, which is again an independent construction methodology rather than a circular reduction. The criticisms that the power/rate normalization in Eq. (15) is inconsistent with the Section VI.B parameters (M=992 vs. JK=480 for J=15) are potentially serious correctness concerns about the reported gain, but they are not instances of circular reasoning: a normalization bug affects the meaning of Eb/N0 but does not make the claimed result equivalent to its input by construction. Overall, no derivation step in the paper reduces to its own output or to a self-citation chain that forces the central claim.

Assumptions & free parameters 4 free parameters · 6 assumptions · 0 invented entities

The central design rests on several unproven or self-cited premises: the GMAC cascade decomposition, the uniform-input symmetry assumption, the capacity formula from the authors' prior work [42], the Monte Carlo transfer to practical decoders, and the power constraint. The main fitted parameters are the polarization-adjusted scaling factor mu_pas and the index set A, both selected by simulation.

free parameters (4)
  • Polarization-adjusted scaling factor mu_pas = mu_inf/mu_red = Varies with Eb/N0 and J; Fig. 7 shows values roughly in range 5 to 30
    Chosen by Monte Carlo simulation to maximize the total capacity (Eq. 28), then used in BER simulations; not derived analytically.
  • Polarized index set A = Selected by Monte Carlo capacity calculation for each (J, mu_pas); subset of {0,...,m-1}
    The code construction chooses the best bit channels via simulated LLR distributions; no closed-form characterization is given.
  • Decoder list size L = 512
    Simulation parameter for SCL and TopL-BMD; not optimized or justified.
  • CRC length CL = 8
    Chosen for simulations; standard but arbitrary.
assumptions (6)
  • standard math The kappa-fold Kronecker matrix G^(kappa) is full rank and its rows form a basis for a vector space over GF(2).
    Used in Section II.A to justify that row selections define a generator matrix.
  • domain assumption The GMAC can be decomposed into a binary-input approximate-symmetric channel (BI-ASC) followed by a multiple-input non-symmetric channel (MI-NSC).
    Section IV.A models the FFMA channel this way; no proof of the decomposition is given and it underpins the capacity expressions.
  • domain assumption Input bits 0 and 1 are uniformly distributed, and the BI-ASC is approximated as symmetric even when the user count is odd.
    Section IV.A.1 states for odd J the output probabilities are close but not equal and then assumes equality.
  • domain assumption The total capacity of the systematic FFMA system is given by Eq. (28), taken from prior work [42].
    Section IV.A.3 cites [42] instead of deriving the sum of the AWGNC and GMAC capacities in this paper.
  • ad hoc to paper Monte Carlo simulation under an ideal SC decoder gives polarized channel capacities that guide the construction of the index set A for the actual SCL/BMD decoders.
    Section IV.B uses this premise to select A; the transfer to finite-blocklength practical decoding is not proven.
  • ad hoc to paper The power constraint in Eq. (15) correctly normalizes total transmitted power.
    The equation uses K where M = J*K appears needed; the paper provides no clarification.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Polarized Element-pair Code Based FFMA over a Gaussian Multiple-access Channel." pith.science (2026). https://pith.science/paper/LXTFVRTD

@misc{pith2026250606796,
  author       = {Pith},
  title        = {Pith review of: Polarized Element-pair Code Based FFMA over a Gaussian Multiple-access Channel},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LXTFVRTD}},
  note         = {Machine review of arXiv:2506.06796}
}
abstract

This paper presents polarized element-pair (EP) codes for polarization-adjusted finite-field multiple-access (PA-FFMA) systems. The core innovation of FFMA systems lies in their unique processing order that exchanges the conventional sequence of channel coding and multiplexing operations, effectively solving the multiuser finite-blocklength (FBL) problem while enhancing error performance. In this architecture, EPs serve as virtual resources for user separation, where different EP codes provide distinct error performance characteristics. The proposed polarized EP code differs from classical polar codes in one aspect that it is specifically designed for Gaussian multiple access channel (GMAC) environments rather than single-user Gaussian channels. We derive the channel capacity for this polarized EP code based FFMA system, then develop an optimal power allocation scheme to maximize multiuser channel capacity. The code construction employs the Marto Loco method for selecting the polarized index set. For decoding, we introduce two specialized algorithms. A successive cancellation list (SCL) decoder for the balanced information-parity section scenarios, and a top $L$ bifurcated minimum distance (Top$L$-BMD) decoder for small payload cases while maintaining comparable error performance. Simulations show that, for $15$ users, our system achieves a $1.25$ dB coding gain compared to the state-of-the-art polar random spreading systems.

Figures

Figures reproduced from arXiv: 2506.06796 by the authors.

Figure 1
Figure 1. A diagram of the systematic FFMA system, where [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. An FFMA system over a GMAC, with the transmitter comprising an EP encoder, a transform function [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. The GMAC can be modeled as a cascade of MI-NSC [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (5 more)
Figure 4
Figure 4. Figure 4: Capacities of individual bit channels for [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 5
Figure 5. Figure 5: Dijkstra’s algorithm on a directed binary tree. When [PITH_FULL_IMAGE:figures/full_fig_p009_5.png]
Figure 6
Figure 6. Figure 6: The capacity of a GMAC, where the number of users [PITH_FULL_IMAGE:figures/full_fig_p010_6.png]
Figure 9
Figure 9. Figure 9: Error performance comparison between PA-FFMA and [PITH_FULL_IMAGE:figures/full_fig_p011_9.png]
Figure 8
Figure 8. Figure 8: Error performance comparison between PA-FFMA and [PITH_FULL_IMAGE:figures/full_fig_p011_8.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

50 extracted references · 42 canonical work pages

  1. [42]

    Finite field multiple access III: From 2-ary to p-ary,

    Q.-Y . Yu, “Finite field multiple access III: From 2-ary to p-ary,” arXiv:2504.06937, Apr. 2025

    arXiv 2025

  2. [1]

    6g typical scenarios and key ca- pabilities,

    IMT-2030 (6G) Promotion Group, “6g typical scenarios and key ca- pabilities,” IMT-2030 (6G) Promotion Group, White Paper, Jul. 2022, [Online]

    work page 2022

  3. [2]

    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, J. S. Thompson, E. G. Larsson, M. D. Renzo, W. Tong, P. Zhu, X. Shen, H. V . Poor, and L. Hanzo, “On the road to 6g: Visions, requirements, key technologies, and testbeds,” IEEE Communications Surveys & Tutorials, vol. 25, no. 2, pp. 905–974, 2023

    work page 2023

  4. [3]

    3rd Generation Partnership Project (3GPP), 5GNR: Medium Access Con- trol (MAC) Protocol Specification, 16th ed., 3rd Generation Partnership Project (3GPP), Jul. 2020

    work page 2020

  5. [4]

    Analyzing novel grant- based and grant-free access schemes for small data transmission,

    H. Zhou, Y . Deng, L. Feltrin, and A. H ¨oglund, “Analyzing novel grant- based and grant-free access schemes for small data transmission,” IEEE Transactions on Communications, vol. 70, no. 4, pp. 2805–2819, 2022

    work page 2022

  6. [5]

    The ALOHA system: Another alternative for computer communications,

    N. Abramson, “The ALOHA system: Another alternative for computer communications,” in Proceedings of the November 17-19, 1970, fall joint computer conference, vol. 37, 1970, pp. 281–285

    work page 1970

  7. [6]

    ALOHA packet system with and without slots and capture,

    L. G. Roberts, “ALOHA packet system with and without slots and capture,” ACM SIGCOMM Computer Communication Review , vol. 5, no. 2, pp. 28–42, Apr. 1975

    work page 1975

  8. [7]

    Graph-based analysis and optimization of contention resolution diversity slotted aloha,

    G. Liva, “Graph-based analysis and optimization of contention resolution diversity slotted aloha,” IEEE Transactions on Communications, vol. 59, no. 2, pp. 477–487, 2011

    2011

Show all 50 references
  1. [8]

    Low complexity schemes for the ran- dom access gaussian channel,

    O. Ordentlich and Y . Polyanskiy, “Low complexity schemes for the ran- dom access gaussian channel,” in 2017 IEEE International Symposium on Information Theory (ISIT) , 2017, pp. 2528–2532

    2017

  2. [9]

    Forward collision resolution- a technique for random multiple-access to the adder channel,

    I. Bar-David, E. Plotnik, and R. Rom, “Forward collision resolution- a technique for random multiple-access to the adder channel,” IEEE Transactions on Information Theory , vol. 39, no. 5, pp. 1671–1675, 1993

    1993

  3. [10]

    Interleave division multiple- access,

    L. Ping, L. Liu, K. Wu, and W. Leung, “Interleave division multiple- access,” IEEE Transactions on Wireless Communications , vol. 5, no. 4, pp. 938–947, 2006

    2006

  4. [11]

    Sparse idma: A joint graph-based coding scheme for unsourced random access,

    A. K. Pradhan, V . K. Amalladinne, A. Vem, K. R. Narayanan, and J.-F. Chamberland, “Sparse idma: A joint graph-based coding scheme for unsourced random access,” IEEE Transactions on Communications , vol. 70, no. 11, pp. 7124–7133, 2022

    2022

  5. [12]

    Iterative detection and decoding of finite-length polar codes in gaussian multiple access channels,

    M. Ebada, S. Cammerer, A. Elkelesh, M. Geiselhart, and S. t. Brink, “Iterative detection and decoding of finite-length polar codes in gaussian multiple access channels,” in 2020 54th Asilomar Conference on Signals, Systems, and Computers , 2020, pp. 683–688. 13

    2020

  6. [13]

    Odma transmission and joint pattern and data recovery for unsourced multiple access,

    J. Yan, G. Song, Y . Li, and J. Wang, “Odma transmission and joint pattern and data recovery for unsourced multiple access,” IEEE Wireless Communications Letters, vol. 12, no. 7, pp. 1224–1228, 2023

    2023

  7. [14]

    Energy efficient sparse code-aided on-off division multiple access,

    J. Gao, P. Fan, N. Li, and D. Jiang, “Energy efficient sparse code-aided on-off division multiple access,”IEEE Wireless Communications Letters, vol. 14, no. 4, pp. 1254–1258, 2025

    2025

  8. [15]

    Polar coding and random spreading for unsourced multiple access,

    A. K. Pradhan, V . K. Amalladinne, K. R. Narayanan, and J.-F. Cham- berland, “Polar coding and random spreading for unsourced multiple access,” in ICC 2020 - 2020 IEEE International Conference on Com- munications (ICC), 2020, pp. 1–6

    2020

  9. [16]

    Unsourced random access using odma and polar codes,

    M. Ozates, M. Kazemi, and T. M. Duman, “Unsourced random access using odma and polar codes,” IEEE Wireless Communications Letters , vol. 13, no. 4, pp. 1044–1047, 2024

    2024

  10. [17]

    Non-binary polar coded system for the two-user multiple-access channel,

    G.-C. Liu and Q.-Y . Yu, “Non-binary polar coded system for the two-user multiple-access channel,” in ICC 2022 - IEEE International Conference on Communications , 2022, pp. 4001–4006

    2022

  11. [18]

    Polar-coded non-orthogonal multiple access,

    J. Dai, K. Niu, Z. Si, C. Dong, and J. Lin, “Polar-coded non-orthogonal multiple access,” IEEE Transactions on Signal Processing, vol. 66, no. 5, pp. 1374–1389, 2018

    2018

  12. [19]

    Polar-coded gaussian multiple-access channels with physical-layer network coding,

    Y . Qiu, Z. Xie, P. Kang, P. Chen, and Y . Fang, “Polar-coded gaussian multiple-access channels with physical-layer network coding,” IEEE Transactions on Vehicular Technology , vol. 73, no. 6, pp. 9083–9087, 2024

    2024

  13. [20]

    A polar code based unsourced random access for the gaussian mac,

    E. Marshakov, G. Balitskiy, K. Andreev, and A. Frolov, “A polar code based unsourced random access for the gaussian mac,” in 2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall), 2019, pp. 1–5

    2019

  14. [21]

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

    E. Arikan, “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

    2009

  15. [22]

    List decoding of polar codes,

    I. Tal and A. Vardy, “List decoding of polar codes,” IEEE Transactions on Information Theory , vol. 61, no. 5, pp. 2213–2226, 2015

    2015

  16. [23]

    Crc-aided decoding of polar codes,

    K. Niu and K. Chen, “Crc-aided decoding of polar codes,” IEEE Communications Letters, vol. 16, no. 10, pp. 1668–1671, 2012

    2012

  17. [24]

    Llr-based suc- cessive cancellation list decoding of polar codes,

    A. Balatsoukas-Stimming, M. B. Parizi, and A. Burg, “Llr-based suc- cessive cancellation list decoding of polar codes,” IEEE Transactions on Signal Processing, vol. 63, no. 19, pp. 5165–5179, 2015

    2015

  18. [25]

    A simplified successive- cancellation decoder for polar codes,

    A. Alamdar-Yazdi and F. R. Kschischang, “A simplified successive- cancellation decoder for polar codes,” IEEE Communications Letters , vol. 15, no. 12, pp. 1378–1380, 2011

    2011

  19. [26]

    Fast list decoders for polar codes,

    G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W. J. Gross, “Fast list decoders for polar codes,” IEEE Journal on Selected Areas in Communications, vol. 34, no. 2, pp. 318–328, 2016

    2016

  20. [27]

    Fast successive-cancellation decoding of polar codes: Identification and decoding of new nodes,

    M. Hanif and M. Ardakani, “Fast successive-cancellation decoding of polar codes: Identification and decoding of new nodes,” IEEE Commu- nications Letters, vol. 21, no. 11, pp. 2360–2363, 2017

    2017

  21. [28]

    Fast successive cancellation decoding of polar codes with large kernels,

    A. Ashikhmin and P. Trifonov, “Fast successive cancellation decoding of polar codes with large kernels,” IEEE Transactions on Communications, vol. 73, no. 1, pp. 3–11, 2025

    2025

  22. [29]

    Sublinear latency for simplified successive cancellation decoding of polar codes,

    M. Mondelli, S. A. Hashemi, J. M. Cioffi, and A. Goldsmith, “Sublinear latency for simplified successive cancellation decoding of polar codes,” IEEE Transactions on Wireless Communications, vol. 20, no. 1, pp. 18– 27, 2021

    2021

  23. [30]

    Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors,

    M. Mondelli, S. H. Hassani, and R. L. Urbanke, “Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors,” IEEE Transactions on Information Theory, vol. 62, no. 12, pp. 6698–6712, 2016

    2016

  24. [31]

    Binary linear codes with optimal scaling: Polar codes with large kernels,

    A. Fazeli, H. Hassani, M. Mondelli, and A. Vardy, “Binary linear codes with optimal scaling: Polar codes with large kernels,” IEEE Transactions on Information Theory , vol. 67, no. 9, pp. 5693–5710, 2021

    2021

  25. [32]

    Polar codes: Characteri- zation of exponent, bounds, and constructions,

    S. B. Korada, E. S ¸as ¸o˘glu, and R. Urbanke, “Polar codes: Characteri- zation of exponent, bounds, and constructions,” IEEE Transactions on Information Theory, vol. 56, no. 12, pp. 6253–6264, 2010

    2010

  26. [33]

    Polar subcodes,

    P. Trifonov and V . Miloslavskaya, “Polar subcodes,” IEEE Journal on Selected Areas in Communications , vol. 34, no. 2, pp. 254–266, 2016

    2016

  27. [34]

    From sequential decoding to channel polarization and back again,

    E. Arıkan, “From sequential decoding to channel polarization and back again,” arXiv preprint arXiv:1908.09594 , 2019

    1908 arXiv

  28. [35]

    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

  29. [36]

    Weight distributions for successive cancellation decoding of polar codes,

    R. Polyanskaya, M. Davletshin, and N. Polyanskii, “Weight distributions for successive cancellation decoding of polar codes,” IEEE Transactions on Communications, vol. 68, no. 12, pp. 7328–7336, 2020

    2020

  30. [37]

    A deterministic algorithm for computing the weight distribution of polar code,

    H. Yao, A. Fazeli, and A. Vardy, “A deterministic algorithm for computing the weight distribution of polar code,” IEEE Transactions on Information Theory , vol. 70, no. 5, pp. 3175–3189, 2024

    2024

  31. [38]

    A perspective on massive random-access,

    Y . Polyanskiy, “A perspective on massive random-access,” in2017 IEEE International Symposium on Information Theory (ISIT), 2017, pp. 2523– 2527

    2017

  32. [39]

    Channel coding rate in the finite blocklength regime,

    Y . Polyanskiy, H. V . Poor, and S. Verdu, “Channel coding rate in the finite blocklength regime,” IEEE Transactions on Information Theory , vol. 56, no. 5, pp. 2307–2359, 2010

    2010

  33. [40]

    Finite field multiple access,

    Q.-Y . Yu, J.-X. Li, and S. Lin, “Finite field multiple access,” arXiv:2303.14086, Mar. 2023

    2023 arXiv

  34. [41]

    Finite field multiple access II: From symbol-wise to codeword-wise,

    Q.-Y . Yu, S.-W. Lin, and T.-W. Yang, “Finite field multiple access II: From symbol-wise to codeword-wise,” arXiv:2503.09991, Mar. 2025

    2025 arXiv

  35. [43]

    Finite field multiple access for sourced massive random access with finite blocklength,

    Q.-Y . Yu, S.-W. Lin, and S. Lin, “Finite field multiple access for sourced massive random access with finite blocklength,” in 2024 IEEE Information Theory Workshop (ITW) , 2024, pp. 741–746

    2024

  36. [44]

    Systematic polar coding,

    E. Arikan, “Systematic polar coding,” IEEE Communications Letters , vol. 15, no. 8, pp. 860–862, 2011

    2011

  37. [45]

    T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed. Beijing, China: Tsinghua University Press, 2010

    2010

  38. [46]

    Efficient design and decoding of polar codes,

    P. Trifonov, “Efficient design and decoding of polar codes,” IEEE Transactions on Communications, vol. 60, no. 11, pp. 3221–3227, 2012

    2012

  39. [47]

    Design and analysis of nonbinary ldpc codes for arbitrary discrete-memoryless channels,

    A. Bennatan and D. Burshtein, “Design and analysis of nonbinary ldpc codes for arbitrary discrete-memoryless channels,” IEEE Transactions on Information Theory , vol. 52, no. 2, pp. 549–583, 2006

    2006

  40. [48]

    How to construct polar codes,

    I. Tal and A. Vardy, “How to construct polar codes,” IEEE Transactions on Information Theory , vol. 59, no. 10, pp. 6562–6582, 2013

    2013

  41. [49]

    Beta-expansion: A theoretical frame- work for fast and recursive construction of polar codes,

    G. He, J.-C. Belfiore, I. Land, G. Yang, X. Liu, Y . Chen, R. Li, J. Wang, Y . Ge, R. Zhang, and W. Tong, “Beta-expansion: A theoretical frame- work for fast and recursive construction of polar codes,” in GLOBECOM 2017 - 2017 IEEE Global Communications Conference , 2017, pp. 1–6

    2017

  42. [50]

    A note on two problems in connexion with graphs,

    E. W. Dijkstra, “A note on two problems in connexion with graphs,” in Edsger Wybe Dijkstra: his life, work, and legacy , 2022, pp. 287–290

    2022

Pith tools

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