Multilevel Construction in Coding and PDEs

• Multilevel construction is a hierarchical design principle that builds global structures from coarse layers for separation and fine layers for local refinement.
• It underpins techniques in constant-dimension coding, multishot subspace coding, coded modulation, and lattice constructions by decomposing problems into nested, tractable levels.
• Applications extend to numerical PDE solvers and adaptive Monte Carlo methods, where hierarchical operators and adaptive resolutions yield efficient computations and improved error control.

Multilevel construction denotes a class of hierarchical design procedures in which a global object is assembled from several coupled levels. In the literature considered here, the term is used for the union over skeleton vectors of lifted Ferrers-diagram rank-metric codes in constant-dimension coding, for nested partitions of $\mathcal{P}(\mathbb{F}_q^m)$ in multishot subspace coding, for bit-level decompositions of coded modulation, for lattice partition chains and quotient-lattice layers, for algebraic or geometric hierarchies of operators in PDE discretization, for adaptive resolution hierarchies in multilevel Monte Carlo, and for gradual levels of finalization assurance in proof-of-stake consensus (Kurz, 2020, 0901.1655, Dai et al., 2020, Campello et al., 2017, Wang et al., 2015, Harbrecht et al., 2018, Gahalaut et al., 2013, Hoel et al., 2014, Wood et al., 2024).

1. General schema and recurrent abstractions

Across these domains, the relevant “level” is usually a quotient, partition, bit-plane, or coarse representation. This suggests that multilevel construction is less a single algorithm than a reusable structural principle: coarse layers control global separation or approximation, while fine layers supply local refinement, rate, or resolution.

Setting	Level objects	Main mechanism
Constant-dimension codes	identifying vectors, Ferrers diagrams	Hamming-distance skeleton plus rank-metric filling
Multishot subspace codes	nested partitions $\Gamma_0,\dots,\Gamma_L$	component block codes select paths in a partition tree
Coded modulation	bit-level subchannels $W_1,\dots,W_m$	per-level codes and rate allocation
Lattice constructions	partition chains, primary quotient sublattices	nested quotients and per-level linear codes
PDE solvers	coarse operators, prolongations, hierarchical complements	Galerkin or hierarchical coarse-grid recursion
MLMC	coarse/fine discretization levels	telescoping estimators with nested refinement

Several papers make this decomposition explicit. In constant-dimension coding, the canonical form is

$\mathcal{C}=\bigcup_{v\in S}\mathcal{C}_v,$

where $S$ is a skeleton code of identifying vectors and each $\mathcal{C}_v$ is a lifted Ferrers-diagram rank-metric component (Kurz, 2020). In lattice network coding, the quotient lattice is decomposed as

$$\Lambda/\Lambda'=\Lambda_{p_1}/\Lambda'_{p_1}\oplus\cdots\oplus\Lambda_{p_m}/\Lambda'_{p_m},$$

so that the message space is itself multilevel (Wang et al., 2015). In multishot subspace coding, the ambient metric is extended additively,

$$d_S(\mathbf{V},\mathbf{U})=\sum_{i=1}^n d_S(V_i,U_i),$$

which turns repeated channel uses into a level-coupled block-coding problem (0901.1655).

2. Subspace and constant-dimension coding

In constant-dimension coding, the basic multilevel construction associated with Etzion–Silberstein proceeds in two conceptual levels. First, one chooses a binary constant-weight code $S\subseteq\mathbb{F}_2^n$ of weight $k$ and minimum Hamming distance at least $\Gamma_0,\dots,\Gamma_L$0. Second, for each $\Gamma_0,\dots,\Gamma_L$1, one constructs a lifted Ferrers diagram rank-metric code $\Gamma_0,\dots,\Gamma_L$2. The metric decomposition is governed by

$\Gamma_0,\dots,\Gamma_L$3

and, when $\Gamma_0,\dots,\Gamma_L$4,

$\Gamma_0,\dots,\Gamma_L$5

so the union

$\Gamma_0,\dots,\Gamma_L$6

has minimum subspace distance at least $\Gamma_0,\dots,\Gamma_L$7 (Kurz, 2020). The same paper formulates a more general multilevel combination theorem for families $\Gamma_0,\dots,\Gamma_L$8 separated by setwise Hamming distance, and uses maximum-weight clique methods to optimize skeleton selection for distance $\Gamma_0,\dots,\Gamma_L$9, improving over 150 lower bounds (Kurz, 2020).

Subsequent work enlarges the outer level and the inner level simultaneously. “Parallel multilevel constructions for constant dimension codes” introduces GRMCs, the family of rank metric codes with given ranks, and combines them with both the classic multilevel construction and the parallel construction $W_1,\dots,W_m$0, $W_1,\dots,W_m$1. For the family $W_1,\dots,W_m$2-CDCs, the ratio between the new lower bound and the known upper bound is calculated and is greater than $W_1,\dots,W_m$3 for any prime power $W_1,\dots,W_m$4 and any $W_1,\dots,W_m$5 (Liu et al., 2019).

A different generalization replaces one-sided identifying vectors by bilateral ones. In the generalized bilateral multilevel construction, a bilateral identifying vector has the form

$W_1,\dots,W_m$6

with $W_1,\dots,W_m$7 an identifying vector, $W_1,\dots,W_m$8 an inverse identifying vector, $W_1,\dots,W_m$9 all zeros, and $\mathcal{C}=\bigcup_{v\in S}\mathcal{C}_v,$0. The associated generalized bilateral Ferrers diagram supports a GB-FD code, and the familiar decomposition reappears: $\mathcal{C}=\bigcup_{v\in S}\mathcal{C}_v,$1 when the bilateral identifying vectors coincide (Li et al., 10 Jul 2025). This framework is then inserted into the parallel mixed dimension construction, yielding improved bounds such as

$\mathcal{C}=\bigcup_{v\in S}\mathcal{C}_v,$2

which improves the previous best known lower bound by $\mathcal{C}=\bigcup_{v\in S}\mathcal{C}_v,$3 codewords (Li et al., 10 Jul 2025).

The inverse direction is developed in “Multilevel inserting constructions for constant dimension subspace codes,” which introduces inverse bilateral identifying vectors, inverse bilateral Ferrers diagram rank-metric codes, and multilevel inserting constructions that combine classical multilevel, inverse multilevel, bilateral multilevel, and inverse bilateral multilevel blocks (Wang et al., 5 Aug 2025). For some CDCs, the ratio of the new lower bound to the known upper bound is greater than $\mathcal{C}=\bigcup_{v\in S}\mathcal{C}_v,$4 for any prime power $\mathcal{C}=\bigcup_{v\in S}\mathcal{C}_v,$5 (Wang et al., 5 Aug 2025).

A related but distinct use appears in multishot subspace coding. There, the projective space $\mathcal{C}=\bigcup_{v\in S}\mathcal{C}_v,$6 is partitioned into nested levels $\mathcal{C}=\bigcup_{v\in S}\mathcal{C}_v,$7, each nested partition has branching factor $\mathcal{C}=\bigcup_{v\in S}\mathcal{C}_v,$8, and each level is protected by a classical block code $\mathcal{C}=\bigcup_{v\in S}\mathcal{C}_v,$9. The resulting multishot code satisfies

$S$0

with $S$1 the intrasubset subspace distance and $S$2 the Hamming distance of $S$3 (0901.1655). In the worked example over $S$4, a 3-shot code of minimum distance $S$5 reaches size $S$6, improving on both a Cartesian product construction of size $S$7 and a classical $S$8-ary parity-check approach of size $S$9 (0901.1655).

3. Bit-level multilevel constructions in coded modulation

In coded modulation, multilevel construction begins from the decomposition of a $\mathcal{C}_v$0-ary symbol into $\mathcal{C}_v$1 bit-levels. For a constellation labeling $\mathcal{C}_v$2, multilevel coding induces binary-input bit subchannels $\mathcal{C}_v$3 satisfying

$\mathcal{C}_v$4

This is the backbone of multilevel polar-coded modulation (Dai et al., 2020).

“Progressive Rate-Filling” recasts multilevel polar-coded modulation as a problem of allocating rates across $\mathcal{C}_v$5 component polar codes once a fixed reliability sequence, such as the 5G Polar sequence, is adopted for each level (Dai et al., 2020). The total number of information bits is

$\mathcal{C}_v$6

and two multilevel filling rules are proposed. RF-I sets

$\mathcal{C}_v$7

where $\mathcal{C}_v$8 is a surrogate channel chosen so that $\mathcal{C}_v$9. RF-II replaces capacity by the finite-blocklength surrogate

$$\Lambda/\Lambda'=\Lambda_{p_1}/\Lambda'_{p_1}\oplus\cdots\oplus\Lambda_{p_m}/\Lambda'_{p_m},$$0

with $$\Lambda/\Lambda'=\Lambda_{p_1}/\Lambda'_{p_1}\oplus\cdots\oplus\Lambda_{p_m}/\Lambda'_{p_m},$$1 tuned so that $$\Lambda/\Lambda'=\Lambda_{p_1}/\Lambda'_{p_1}\oplus\cdots\oplus\Lambda_{p_m}/\Lambda'_{p_m},$$2 (Dai et al., 2020). The resulting construction has effective $$\Lambda/\Lambda'=\Lambda_{p_1}/\Lambda'_{p_1}\oplus\cdots\oplus\Lambda_{p_m}/\Lambda'_{p_m},$$3 complexity and, under the consistence property, the RF-I-based scheme is capacity-achieving as $$\Lambda/\Lambda'=\Lambda_{p_1}/\Lambda'_{p_1}\oplus\cdots\oplus\Lambda_{p_m}/\Lambda'_{p_m},$$4 (Dai et al., 2020).

For the degraded AWGN broadcast channel under a fixed constellation constraint, multilevel construction is used to localize superposition coding at the bit level. A multilevel inner code achieves the constellation-constrained capacity when the capacity-achieving conditional distribution factors as

$$\Lambda/\Lambda'=\Lambda_{p_1}/\Lambda'_{p_1}\oplus\cdots\oplus\Lambda_{p_m}/\Lambda'_{p_m},$$5

and a full multilevel superposition is described through level-wise rate constraints

$$\Lambda/\Lambda'=\Lambda_{p_1}/\Lambda'_{p_1}\oplus\cdots\oplus\Lambda_{p_m}/\Lambda'_{p_m},$$6

(Abotabl et al., 2016). The pragmatic construction further localizes coupling through bit-additive superposition,

$$\Lambda/\Lambda'=\Lambda_{p_1}/\Lambda'_{p_1}\oplus\cdots\oplus\Lambda_{p_m}/\Lambda'_{p_m},$$7

and the paper shows that, under natural labeling, the code coupling can be relaxed to only one bit level with little or no penalty (Abotabl et al., 2016). A hybrid MLC-BICM architecture then reduces the number of encoders while staying very close to the boundary of the constellation-constrained capacity region (Abotabl et al., 2016).

4. Lattice-based multilevel constructions

In lattice coding for compound block-fading channels, multilevel construction takes the form of a partition chain

$$\Lambda/\Lambda'=\Lambda_{p_1}/\Lambda'_{p_1}\oplus\cdots\oplus\Lambda_{p_m}/\Lambda'_{p_m},$$8

with a code $$\Lambda/\Lambda'=\Lambda_{p_1}/\Lambda'_{p_1}\oplus\cdots\oplus\Lambda_{p_m}/\Lambda'_{p_m},$$9 placed on each quotient $$d_S(\mathbf{V},\mathbf{U})=\sum_{i=1}^n d_S(V_i,U_i),$$0 (Campello et al., 2017). Capacity is analyzed through mod-$$d_S(\mathbf{V},\mathbf{U})=\sum_{i=1}^n d_S(V_i,U_i),$$1 and partition channels, and the conservation rule

$$d_S(\mathbf{V},\mathbf{U})=\sum_{i=1}^n d_S(V_i,U_i),$$2

allows the total achievable normalized log-density to be written as a sum of per-level capacities (Campello et al., 2017). Using algebraic partitions from number fields, the authors construct multilevel lattice codes that universally approach the capacity of the compound block-fading channel and exhibit a gap to the theoretical Poltyrev limit of about $$d_S(\mathbf{V},\mathbf{U})=\sum_{i=1}^n d_S(V_i,U_i),$$3 dB with a worst/best fading gap as small as $$d_S(\mathbf{V},\mathbf{U})=\sum_{i=1}^n d_S(V_i,U_i),$$4 dB in a $$d_S(\mathbf{V},\mathbf{U})=\sum_{i=1}^n d_S(V_i,U_i),$$5-based example (Campello et al., 2017).

In lattice network coding, the multilevel structure is formalized through the decomposition of the quotient lattice into primary components,

$$d_S(\mathbf{V},\mathbf{U})=\sum_{i=1}^n d_S(V_i,U_i),$$6

and the corresponding message space

$$d_S(\mathbf{V},\mathbf{U})=\sum_{i=1}^n d_S(V_i,U_i),$$7

(Wang et al., 2015). The elementary divisor construction defines

$$d_S(\mathbf{V},\mathbf{U})=\sum_{i=1}^n d_S(V_i,U_i),$$8

with $$d_S(\mathbf{V},\mathbf{U})=\sum_{i=1}^n d_S(V_i,U_i),$$9, and subsumes complex Construction A when $S\subseteq\mathbb{F}_2^n$0 and complex Construction D when $S\subseteq\mathbb{F}_2^n$1 (Wang et al., 2015). This decomposition enables layered integer forcing, where the relay decodes a linear combination at each layer through a level-specific homomorphism $S\subseteq\mathbb{F}_2^n$2 and quotient $S\subseteq\mathbb{F}_2^n$3 (Wang et al., 2015).

A third lattice-based line studies the code-formula family itself. Construction C is

$S\subseteq\mathbb{F}_2^n$4

while Construction $S\subseteq\mathbb{F}_2^n$5 is

$S\subseteq\mathbb{F}_2^n$6

for a single main code $S\subseteq\mathbb{F}_2^n$7 (Bollauf et al., 2018). Two-level Construction C and two-level Construction $S\subseteq\mathbb{F}_2^n$8 are geometrically uniform, whereas Construction C with $S\subseteq\mathbb{F}_2^n$9 is typically not geometrically uniform (Bollauf et al., 2018). Laticeness of Construction C is characterized by nestedness and closure under Schur product, and laticeness of Construction $k$0 is characterized by the carry set condition $k$1 (Bollauf et al., 2018). The asymptotic comparison is especially sharp: random Construction $k$2 can achieve Minkowski’s bound

$k$3

whereas the balanced Construction C analysis reported in the paper yields

$k$4

(Bollauf et al., 2018).

5. Operator, basis, and mesh hierarchies in numerical analysis

In numerical PDEs, multilevel construction is the explicit creation of a hierarchy of spaces, operators, and transfer maps. For elliptic tensor product problems, the algebraic multilevel construction of Griebel, Harbrecht, and collaborators begins from a finest-level system

$k$5

and replaces geometric refinement by an AMG-generated hierarchy $k$6, $k$7 (Harbrecht et al., 2018). At each level, the index set is split into coarse and fine variables, strong couplings are inferred from the matrix graph, prolongation and restriction are constructed algebraically, and Galerkin coarse operators are defined by

$k$8

(Harbrecht et al., 2018). This hierarchy is then lifted to tensor products and sparse grids. Under geometric assumptions one obtains

$k$9

and the numerical results show that the algebraic construction exhibits the same convergence behaviour as the geometric construction while remaining applicable to complex geometries, unstructured grids, and black-box type PDE solvers (Harbrecht et al., 2018).

In isogeometric analysis, the multilevel construction centers on explicit transfer operators and hierarchical complements. For each level $\Gamma_0,\dots,\Gamma_L$00, coarse and fine B-spline spaces are connected by a restriction operator $\Gamma_0,\dots,\Gamma_L$01, and the hierarchical basis transformation is

$\Gamma_0,\dots,\Gamma_L$02

with

$\Gamma_0,\dots,\Gamma_L$03

(Gahalaut et al., 2013). The paper provides explicit representations of B-spline basis functions for fixed mesh size $\Gamma_0,\dots,\Gamma_L$04, degrees $\Gamma_0,\dots,\Gamma_L$05, and both $\Gamma_0,\dots,\Gamma_L$06- and $\Gamma_0,\dots,\Gamma_L$07-continuity, together with coarse grid operators, hierarchical complementary operators, and AMLI preconditioners (Gahalaut et al., 2013). The reported numerical studies show $\Gamma_0,\dots,\Gamma_L$08- and (almost) $\Gamma_0,\dots,\Gamma_L$09-independent convergence rates for AMLI cycles on square, quarter annulus, and quarter thick ring geometries (Gahalaut et al., 2013).

6. Adaptive resolution, graded assurance, and recurrent limitations

A further use of multilevel construction appears in stochastic simulation. For Euler–Maruyama discretizations of SDEs, the paper on adaptive MLMC derives the mean square error expansion

$\Gamma_0,\dots,\Gamma_L$10

with local indicator

$\Gamma_0,\dots,\Gamma_L$11

and an equidistribution principle $\Gamma_0,\dots,\Gamma_L$12 constant across time steps (Hoel et al., 2014). This produces a pathwise adaptive time stepping Euler–Maruyama method, and the multilevel hierarchy is then built through nested adaptive meshes and Brownian-bridge refinement. The resulting adaptive MLMC method achieves the near-optimal MLMC cost rate

$\Gamma_0,\dots,\Gamma_L$13

and, in low-regularity examples, outperforms the uniform time stepping MLMC method by orders of magnitude (Hoel et al., 2014).

In blockchain consensus, multilevel construction appears as a graded assurance mechanism rather than a discretization hierarchy. “Optimal Multilevel Slashing for Blockchains” defines multilevel slashing as a setting in which proof-of-stake validators can obtain gradual levels of assurance that a certain block is bound to be finalized in a global consensus procedure, unless an increasing and optimally large number of Byzantine processes have their staked assets slashed (Wood et al., 2024). The construction is described as a highly parameterized generalization of combinatorial intersection systems based on finite projective spaces, with asymptotic high availability and optimal slashing properties, and the paper identifies a fundamental trade off between message complexity, load, and slashing (Wood et al., 2024). The resulting levels can be interpreted either as an early, slashing-based block finalization or as a service to support reorg tolerance (Wood et al., 2024).

The literature also records recurrent limitations. For algebraic sparse tensor-product hierarchies, no rigorous theory is given for the decay of $\Gamma_0,\dots,\Gamma_L$14 versus $\Gamma_0,\dots,\Gamma_L$15 under general AMG (Harbrecht et al., 2018). For Ferrers-diagram rank-metric constructions, the tightness of the general bounds beyond distance $\Gamma_0,\dots,\Gamma_L$16 remains conjectural rather than fully proved (Kurz, 2020). For multilevel constellations, Construction C and Construction $\Gamma_0,\dots,\Gamma_L$17 with $\Gamma_0,\dots,\Gamma_L$18 are in general not geometrically uniform (Bollauf et al., 2018). For adaptive MLMC, the rigorous MSE expansion assumes strong smoothness and the low-regularity applications use the expansion formally (Hoel et al., 2014). This suggests that multilevel construction is most mature when the interactions between levels are algebraically transparent—through Hamming/rank decompositions, nested quotient modules, or explicit coarse-grid recursions—and becomes technically delicate when carries, irregular geometry, or low regularity dominate.