pith. sign in

arxiv: 2604.06125 · v1 · submitted 2026-04-07 · 💻 cs.IT · math.IT

Multilevel Coset Codes on Lattices

Leopold Bertholet , Chloe Makdad , Stephen Mackes , Daniel Chew , Matthew Robinson This is my paper

Pith reviewed 2026-05-10 18:03 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords coset codesmultilevel codingpolar codeslattice codesVoronoi shapingAWGN channel16-QAMerror correction
0
0 comments X

The pith

Coset Bombe codes generalize polar codes to lattices and outperform BICM and MLC on 16-QAM by up to 0.8 dB while halving latency.

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

This paper introduces coset Bombe codes, a new class of multilevel coset codes built on dense lattices. The codes generalize polar codes by applying multilevel coding with non-binary component codes matched to lattice modulations and adding Voronoi shaping. Simulations in AWGN channels for 16-QAM show these codes deliver better bit and block error rates than both bit-interleaved coded modulation and conventional multilevel coding. The gains reach 0.8 dB and block latency drops by half for code lengths of 256 and 1024 bits. Readers would care because the results suggest a practical route to higher efficiency in short-block wireless links without sacrificing reliability.

Core claim

Coset Bombe codes are a novel class of multilevel coset codes that generalize polar codes to dense lattice structures. By leveraging multilevel coding with non-binary codes designed for the lattice modulations and making use of Voronoi shaping, Bombe codes integrate the geometric strengths of dense lattices such as D4 with the capacity-approaching properties of polar codes.

What carries the argument

Multilevel coset codes on lattices, called coset Bombe codes, which generalize polar codes by using non-binary component codes tailored to lattice modulations together with Voronoi shaping to exploit lattice geometry.

If this is right

  • Coset Bombe codes outperform both BICM and MLC state-of-the-art schemes on 16-QAM in AWGN channels.
  • The scheme achieves up to 0.8 dB of coding gain.
  • Block size latency is reduced by half while maintaining superior BER and BLER performance.
  • The advantages hold for codewords of 256 and 1024 bits.

Where Pith is reading between the lines

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

  • The lattice-based multilevel approach could extend to other constellations such as 64-QAM or to non-AWGN channels.
  • Reduced latency may support real-time applications that currently require longer blocks.
  • Hybrid schemes combining Bombe codes with other lattice constructions could be explored for further efficiency.

Load-bearing premise

The assumption that multilevel coding with non-binary codes designed for lattice modulations, combined with Voronoi shaping, will deliver the reported performance gains consistently when implemented beyond the specific simulated conditions and code lengths described.

What would settle it

An AWGN simulation or hardware test on 16-QAM showing no improvement in bit or block error rate over standard MLC at the SNRs where 0.8 dB gain was claimed, or no latency reduction for 1024-bit blocks, would falsify the superiority.

Figures

Figures reproduced from arXiv: 2604.06125 by Chloe Makdad, Daniel Chew, Leopold Bertholet, Matthew Robinson, Stephen Mackes.

Figure 1
Figure 1. Figure 1: BER (left) and BLER (right) curves for D4 Bombe codes compared to state-of-the-art polar coded modulations, all with nb = 256. We use r = 4 for our Bombe code and a 16-QAM for the polar codes. See the legend in [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: BER (left) and BLER (right) curves for D4 Bombe codes compared to state-of-the-art polar coded modulations, all with nb = 1024. We use r = 4 for our Bombe code and a 16-QAM for the polar codes. for x ∈ 2 i−1Λ/2 iΛ, where C (i) x = {y ∈ C | y = x mod 2iΛ}. The complexity of the marginalization step may be simplified using max-log approximations. In our results, we use Λ = D4 and r = 4, so |C| = 256 and |Λ/2… view at source ↗
read the original abstract

This work introduces coset Bombe codes, a novel class of multilevel coset codes that generalize polar codes to dense lattice structures. By leveraging multilevel coding with non-binary codes designed for the lattice modulations and making use of Voronoi shaping, Bombe codes integrate the geometric strengths of dense lattices such as $D_4$ with the capacity-approaching properties of polar codes. Experimental results in additive white Gaussian noise (AWGN) channels demonstrate that coset Bombe codes significantly outperform both BICM and MLC state-of-the-art schemes on 16-QAM. The proposed scheme simulated on AWGN achieves up to 0.8 dB of gain and reduces block size latency by half while maintaining superior bit and block error rate (BER/BLER) performance on codewords of 256 and 1024 bits.

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

1 major / 0 minor

Summary. The paper introduces coset Bombe codes as a novel class of multilevel coset codes that generalize polar codes to dense lattice structures such as D4. It combines multilevel coding with non-binary codes designed for lattice modulations and Voronoi shaping. Simulations on AWGN channels for 16-QAM claim up to 0.8 dB gain over BICM and MLC schemes, halved block latency, and superior BER/BLER on 256- and 1024-bit codewords.

Significance. If the experimental claims hold with verifiable constructions and fair baselines, the work could advance coding for lattice modulations by bridging polar-code capacity-approaching properties with lattice geometry, potentially enabling lower-latency, higher-performance schemes for higher-order QAM in wireless systems.

major comments (1)
  1. Abstract: The central performance claims (0.8 dB gain, halved latency, superior BER/BLER) rest on simulations but supply no details on coset code construction, non-binary polar code design, Voronoi shaping parameters, simulation setup, error bars, or exact BICM/MLC baseline implementations. This absence is load-bearing for assessing whether the reported gains are reproducible or fairly compared.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the detailed review and for identifying the need for additional information to support the performance claims. We agree that the original abstract was too concise and have revised the manuscript to incorporate the requested details on constructions, parameters, and simulation methodology.

read point-by-point responses

  1. Referee: Abstract: The central performance claims (0.8 dB gain, halved latency, superior BER/BLER) rest on simulations but supply no details on coset code construction, non-binary polar code design, Voronoi shaping parameters, simulation setup, error bars, or exact BICM/MLC baseline implementations. This absence is load-bearing for assessing whether the reported gains are reproducible or fairly compared.

    Authors: We agree that the abstract lacked sufficient detail for reproducibility. In the revised manuscript we have expanded the abstract to include a concise description of the D4-based multilevel coset construction, the non-binary polar code design rules, the specific Voronoi shaping parameters, the AWGN channel simulation setup (including SNR ranges, Monte Carlo trial counts, and block lengths of 256 and 1024 bits), and the precise BICM and MLC baseline implementations used for comparison. Error bars have been added to all performance figures, and a new subsection in the experimental results section provides the full simulation methodology. These revisions directly address the concern while preserving the abstract's brevity. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The abstract and available description introduce coset Bombe codes as a generalization of polar codes via multilevel coding and Voronoi shaping on lattices like D4, then report empirical AWGN simulation results (0.8 dB gain, halved latency, superior BER/BLER on 256/1024-bit codewords vs. BICM/MLC baselines). No equations, parameter-fitting steps, self-citations, or derivation chains are supplied that reduce a claimed result to its own inputs by construction. Performance claims rest on external experimental comparisons rather than quantities defined in terms of the same work's fitted values or renamed ansatzes. This is the normal non-circular case for a simulation-driven coding paper.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review provides no explicit free parameters, axioms, or invented entities. The work appears to rely on standard AWGN channel assumptions and existing polar/lattice theory without new postulates detailed here.

pith-pipeline@v0.9.0 · 5435 in / 1239 out tokens · 52541 ms · 2026-05-10T18:03:38.159957+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

33 extracted references · 33 canonical work pages

  1. [1]

    Communication in the presence of noise,

    C. Shannon, “Communication in the presence of noise,”Proceedings of the IRE, vol. 37, no. 1, pp. 10–21, 1949

    work page 1949

  2. [2]

    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,” inProceedings of ICC ’93 - IEEE International Conference on Communications, vol. 2, 1993, pp. 1064–1070 vol.2

    work page 1993

  3. [3]

    R. G. Gallager,Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963

    work page 1963

  4. [4]

    Near Shannon limit performance of low density parity check codes,

    D. J. C. MacKay and R. M. Neal, “Near Shannon limit performance of low density parity check codes,” inElectronics Letters, vol. 33, no. 6, 1997, pp. 457–458

    work page 1997

  5. [5]

    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, Jul. 2009

    work page 2009

  6. [6]

    J. H. Conway and N. J. A. Sloane,Sphere Packings, Lattices and Groups, 3rd ed., ser. Grundlehren der mathematischen Wissenschaften. Springer, 1999, vol. 290

    work page 1999

  7. [7]

    Achieving 1/2 log (1+snr) on the awgn channel with lattice encoding and decoding,

    U. Erez and R. Zamir, “Achieving 1/2 log (1+snr) on the awgn channel with lattice encoding and decoding,”IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2293–2314, 2004

    work page 2004

  8. [8]

    Multidimensional constellations. i. intro- duction, figures of merit, and generalized cross constellations,

    G. Forney and L.-F. Wei, “Multidimensional constellations. i. intro- duction, figures of merit, and generalized cross constellations,”IEEE Journal on Selected Areas in Communications, vol. 7, no. 6, pp. 877– 892, 1989

    work page 1989

  9. [9]

    The art of signaling: fifty years of coding theory,

    A. Calderbank, “The art of signaling: fifty years of coding theory,”IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2561–2595, 1998

    work page 1998

  10. [10]

    Channel coding with multilevel/phase signals,

    G. Ungerboeck, “Channel coding with multilevel/phase signals,”IEEE Transactions on Information Theory, vol. 28, no. 1, pp. 55–67, 1982

    work page 1982

  11. [11]

    A new multilevel coding method using error- correcting codes,

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

    work page 1977

  12. [12]

    Multilevel codes: theoretical concepts and practical design rules,

    U. Wachsmann, R. Fischer, and J. Huber, “Multilevel codes: theoretical concepts and practical design rules,”IEEE Transactions on Information Theory, vol. 45, no. 5, pp. 1361–1391, 1999

    work page 1999

  13. [13]

    Coset codes. i. introduction and geometrical classifi- cation,

    G. D. Forney, “Coset codes. i. introduction and geometrical classifi- cation,”IEEE Transactions on Information Theory, vol. 34, no. 5, pp. 1123–1151, 1988

    work page 1988

  14. [14]

    Sphere-bound-achieving coset codes and multilevel coset codes,

    G. D. Forney, M. D. Trott, and S.-Y . Chung, “Sphere-bound-achieving coset codes and multilevel coset codes,”IEEE Transactions on Infor- mation Theory, vol. 46, no. 3, pp. 820–850, 2000

    work page 2000

  15. [15]

    Polar-coded modulation,

    M. Seidl, A. Schenk, C. Stierstorfer, and J. B. Huber, “Polar-coded modulation,”IEEE Transactions on Communications, vol. 61, no. 10, pp. 4108–4119, 2013

    work page 2013

  16. [16]

    Construction of capacity-achieving lattice codes: Polar lattices,

    L. Liu, Y . Yan, C. Ling, and X. Wu, “Construction of capacity-achieving lattice codes: Polar lattices,”IEEE Transactions on Communications, vol. 67, no. 2, pp. 915–928, 2018

    work page 2018

  17. [17]

    Bit-interleaved coded modula- tion,

    G. Caire, G. Taricco, and E. Biglieri, “Bit-interleaved coded modula- tion,” inProceedings of IEEE International Symposium on Information Theory, 1997, pp. 96–

    work page 1997

  18. [18]

    Low-complexity geometric shaping,

    A. Mirani, E. Agrell, and M. Karlsson, “Low-complexity geometric shaping,”Journal of Lightwave Technology, vol. 39, no. 2, pp. 363– 371, 2020

    work page 2020

  19. [19]

    Coded modulation schemes for voronoi constellations,

    S. Li, A. Mirani, M. Karlsson, and E. Agrell, “Coded modulation schemes for voronoi constellations,”IEEE Transactions on Communi- cations, 2025

    work page 2025

  20. [20]

    Bandwidth efficient and rate- matched LDPC coded modulation with probabilistic shaping,

    G. B ¨ocherer, F. Steiner, and P. Schulte, “Bandwidth efficient and rate- matched LDPC coded modulation with probabilistic shaping,”IEEE Transactions on Communications, vol. 63, no. 12, pp. 4651–4665, 2015

    work page 2015

  21. [21]

    Constant composition distribution match- ing,

    P. Schulte and G. B ¨ocherer, “Constant composition distribution match- ing,”IEEE Transactions on Information Theory, vol. 62, no. 1, pp. 430– 434, 2016

    work page 2016

  22. [22]

    Bit-interleaved coded modula- tion,

    G. Caire, G. Taricco, and E. Biglieri, “Bit-interleaved coded modula- tion,”IEEE Transactions on Information Theory, vol. 44, no. 3, pp. 927–946, 1998

    work page 1998

  23. [23]

    Available: http://arxiv.org/abs/1501.02473

    H. Vangala, E. Viterbo, and Y . Hong, “A comparative study of polar code constructions for the awgn channel,” 2015. [Online]. Available: https://arxiv.org/abs/1501.02473

    work page arXiv 2015

  24. [24]

    Fast quantizing and decoding and algorithms for lattice quantizers and codes,

    J. Conway and N. Sloane, “Fast quantizing and decoding and algorithms for lattice quantizers and codes,”IEEE Transactions on Information Theory, vol. 28, no. 2, pp. 227–232, 2003

    work page 2003

  25. [25]

    Source and channel polarization over finite fields and reed–solomon matrices,

    R. Mori and T. Tanaka, “Source and channel polarization over finite fields and reed–solomon matrices,”IEEE Transactions on Information Theory, vol. 60, no. 5, pp. 2720–2736, 2014

    work page 2014

  26. [26]

    Systematic polar coding,

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

    work page 2011

  27. [27]

    Flexible and low-complexity encoding and decoding of systematic polar codes,

    G. Sarkis, I. Tal, P. Giard, A. Vardy, C. Thibeault, and W. J. Gross, “Flexible and low-complexity encoding and decoding of systematic polar codes,” 2015. [Online]. Available: https://arxiv.org/abs/1507.03614

    work page arXiv 2015

  28. [28]

    Successive and two-stage systematic encoding of polar subcodes,

    R. Morozov and P. Trifonov, “Successive and two-stage systematic encoding of polar subcodes,”IEEE Wireless Communications Letters, vol. 8, no. 3, pp. 877–880, 2019

    work page 2019

  29. [29]

    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

    work page 2015

  30. [30]

    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

    work page 2012

  31. [31]

    Path metric inherited scl decoding of multilevel polar-coded systems,

    D. Zhang, B. Wu, and K. Niu, “Path metric inherited scl decoding of multilevel polar-coded systems,” in2021 IEEE wireless communications and networking conference workshops (WCNCW). IEEE, 2021, pp. 1–6

    work page 2021

  32. [32]

    Construction and decoding algorithms for polar codes based on 2×2 non-binary kernels,

    P. Yuan and F. Steiner, “Construction and decoding algorithms for polar codes based on 2×2 non-binary kernels,” in2018 IEEE 10th Interna- tional Symposium on Turbo Codes & Iterative Information Processing (ISTC). IEEE, 2018, pp. 1–5

    work page 2018

  33. [33]

    NR; Multiplexing and channel coding,

    3GPP, “NR; Multiplexing and channel coding,” 3rd Generation Partner- ship Project (3GPP), Tech. Rep. 38.212

    work page