Interleaving: Theory, Methods, and Applications

• Interleaving is a structural operation that alternates sequences or processes while preserving designated local rules such as order, dependency, and synchronization.
• It is applied in fields like symbolic dynamics, topological data analysis, coding, and communication to enhance error correction and system performance.
• Interleaving underpins methods in data compression, concurrent scheduling, and memory security by strategically multiplexing components to mitigate burst errors and latency.

Interleaving denotes a family of operations and design patterns in which multiple sequences, processes, codewords, or representations are alternated within a common structure while preserving a specified local order, dependency, or synchronization rule. In symbolic dynamics it is an operation on one-sided infinite words and path sets; in topological data analysis it is a shift-based comparison between persistence modules; in coding and communication it is a permutation mechanism used to spread burst errors across codewords; in compression it is a way of multiplexing multiple coders into one bitstream; and in concurrency theory it distinguishes unconstrained parallel composition from scheduler-governed execution (Abram et al., 2021, Nelson et al., 2022, Giesen, 2014, Bergstra et al., 2017).

1. Sequence-level semantics

In symbolic dynamics, interleaving is defined on one-sided infinite sequences over a finite alphabet. If $x_j=a_{j,0}a_{j,1}a_{j,2}\cdots$ for $0\le j\le n-1$, their $n$-fold interleaving $$x=x_0\circledast\cdots\circledast x_{n-1}=b_0b_1b_2\cdots$$ is given by

$b_{ni+k}=a_{k,i}\qquad (i\ge 0,\ 0\le k\le n-1).$

For sets $X_0,\dots,X_{n-1}\subseteq \mathcal A^{\mathbb N}$, membership is characterized by residue classes modulo $n$: $x\in X_0\circledast\cdots\circledast X_{n-1}$ iff each subsequence $x_jx_{j+n}x_{j+2n}\ldots$ lies in $X_j$. The companion decimation maps are

$0\le j\le n-1$0

and principal decimations reconstruct the original sequence: $0\le j\le n-1$1 In this setting interleaving is generally not commutative and not associative, but path sets are closed under all $0\le j\le n-1$2-fold interleavings, and factorization, when it exists, is unique and determined by the principal decimations (Abram et al., 2021).

A closely related language-theoretic form appears in XML schema inference and regular expressions with interleaving. There, interleaving denotes shuffle: two words are merged in all ways that preserve the internal order of each constituent. The paper on XML schema inference gives the recursive semantics

$0\le j\le n-1$3

and for $0\le j\le n-1$4, $0\le j\le n-1$5,

$0\le j\le n-1$6

Its basic example is that interleaving $0\le j\le n-1$7 with $0\le j\le n-1$8 yields $0\le j\le n-1$9. This semantics is used to learn XML content models in Relax NG, where unordered sibling structure is common (Dong et al., 2019).

2. Interleaving as a metric and categorical structure

In persistent homology, interleaving is a comparison relation between persistence modules. For 1-parameter persistence vector spaces $n$0 and $n$1, an $n$2-interleaving consists of $n$3-shift maps $n$4 and $n$5 satisfying

$n$6

The interleaving distance is the infimum of such $n$7, and in the Vietoris–Rips setting the isometry theorem identifies it with bottleneck distance on persistence diagrams. In topology-preserving dimensionality reduction, this $n$8 is used as a certification scale: features in the embedding with persistence $n$9 incur no type-I errors, and features in the original data with persistence $$x=x_0\circledast\cdots\circledast x_{n-1}=b_0b_1b_2\cdots$$0 must have corresponding selected features in the embedding (Nelson et al., 2022).

A broader categorical theory defines interleavings as solutions to an extension problem. Given functors $$x=x_0\circledast\cdots\circledast x_{n-1}=b_0b_1b_2\cdots$$1 and $$x=x_0\circledast\cdots\circledast x_{n-1}=b_0b_1b_2\cdots$$2 with common codomain, they are interleaved if they extend along embeddings of $$x=x_0\circledast\cdots\circledast x_{n-1}=b_0b_1b_2\cdots$$3 and $$x=x_0\circledast\cdots\circledast x_{n-1}=b_0b_1b_2\cdots$$4 into a common ambient category $$x=x_0\circledast\cdots\circledast x_{n-1}=b_0b_1b_2\cdots$$5. Quantification then leads to weighted categories, induced Lawvere metrics, and categorical analogues of Hausdorff and Gromov–Hausdorff distance. In this framework the interleaving distance of functors is an infimum over ambient weighted embeddings, and stability under postcomposition is retained (Bubenik et al., 2017).

Representation theory supplies a more algebraic reformulation. For a fixed translation $$x=x_0\circledast\cdots\circledast x_{n-1}=b_0b_1b_2\cdots$$6, the category of $$x=x_0\circledast\cdots\circledast x_{n-1}=b_0b_1b_2\cdots$$7-interleavings is isomorphic to the representation category of the $$x=x_0\circledast\cdots\circledast x_{n-1}=b_0b_1b_2\cdots$$8-shoelace, a proset built from two copies of the indexing category tied together by $$x=x_0\circledast\cdots\circledast x_{n-1}=b_0b_1b_2\cdots$$9-controlled cross-relations. This viewpoint yields the structural result that any two interleavings of the same pair of persistence modules are themselves interleaved. Over $b_{ni+k}=a_{k,i}\qquad (i\ge 0,\ 0\le k\le n-1).$0, interval-decomposable shoelace representations correspond to essential $b_{ni+k}=a_{k,i}\qquad (i\ge 0,\ 0\le k\le n-1).$1-matchings of barcodes (Escolar et al., 2020).

Finite weighted discretizations do not always preserve the classical “same-height matching” argument for arbitrary weights, but the defect can be repaired by passing to a shift refinement $b_{ni+k}=a_{k,i}\qquad (i\ge 0,\ 0\le k\le n-1).$2. On the enlarged category $b_{ni+k}=a_{k,i}\qquad (i\ge 0,\ 0\le k\le n-1).$3, the interleaving and bottleneck metrics coincide again, and the classical interleaving distance on $b_{ni+k}=a_{k,i}\qquad (i\ge 0,\ 0\le k\le n-1).$4 is recovered as a limit over finer finite discretizations (Meehan et al., 2017).

3. Coding and communication

In communication systems, interleaving is classically a burst-mitigation device. A block interleaver of depth $b_{ni+k}=a_{k,i}\qquad (i\ge 0,\ 0\le k\le n-1).$5 writes $b_{ni+k}=a_{k,i}\qquad (i\ge 0,\ 0\le k\le n-1).$6 codewords row-wise into a matrix and transmits column-wise, so adjacent bits of a codeword are separated by $b_{ni+k}=a_{k,i}\qquad (i\ge 0,\ 0\le k\le n-1).$7 transmission intervals. For a correlated bit-error process with lag-1 normalized autocorrelation coefficient $b_{ni+k}=a_{k,i}\qquad (i\ge 0,\ 0\le k\le n-1).$8, the residual correlation between successive bits of the same deinterleaved codeword is modeled as

$b_{ni+k}=a_{k,i}\qquad (i\ge 0,\ 0\le k\le n-1).$9

At the packet level, if a packet contains $X_0,\dots,X_{n-1}\subseteq \mathcal A^{\mathbb N}$0 interleaving blocks and $X_0,\dots,X_{n-1}\subseteq \mathcal A^{\mathbb N}$1 denotes the error probability of one interleaved codeblock, the paper uses

$X_0,\dots,X_{n-1}\subseteq \mathcal A^{\mathbb N}$2

Three analytical models are developed: an absorbing Markov chain over the number of bit errors per codeword, a two-state codeword Markov chain derived from the two-codeword joint distribution, and a simpler two-state model with a closed-form packet error probability. The reported conclusion is that interleaving depth should be chosen against measured channel correlation rather than fixed heuristically (Moltchanov et al., 2018).

That conventional rationale is not universal. For short, high-rate, low-latency communication on bursty Markov channels, interleaving is described as a workaround for decoder mismatch. In the GRAND-MO framework, the decoder is matched directly to correlated noise rather than to a memoryless BSC assumption. The paper reports that for highly correlated bursts, at target BLER $X_0,\dots,X_{n-1}\subseteq \mathcal A^{\mathbb N}$3, GRAND-MO obtains more than $X_0,\dots,X_{n-1}\subseteq \mathcal A^{\mathbb N}$4 gain over Berlekamp–Massey on BCH$X_0,\dots,X_{n-1}\subseteq \mathcal A^{\mathbb N}$5, and that even highly interleaved conventional BCH decoding remains behind non-interleaved GRAND-MO by a consistent $X_0,\dots,X_{n-1}\subseteq \mathcal A^{\mathbb N}$6 at BLER $X_0,\dots,X_{n-1}\subseteq \mathcal A^{\mathbb N}$7. It also states that recovering near-BSC behavior for conventional decoding may require interleaving over hundreds of packets, i.e. tens of thousands of bits (An et al., 2020).

Several coding constructions treat interleaving as part of the code design rather than as a channel-only device. For product LDPC codes, a constrained column interleaver modifies the Tanner graph while preserving the product minimum distance

$X_0,\dots,X_{n-1}\subseteq \mathcal A^{\mathbb N}$8

The interleaved parity-check matrix becomes

$X_0,\dots,X_{n-1}\subseteq \mathcal A^{\mathbb N}$9

and modified PEG designs yield either circulant-permutation interleavers or general permutation interleavers. In the reported examples, circulant interleaving gives about $n$0 gain, while general permutation interleaving gives more than $n$1 gain and reduces low-weight multiplicities (Baldi et al., 2011).

For concatenated systems with a polar inner code under SC decoding, the relevant issue is not channel memory but decoder-induced dependence. The paper proves that the errors of $n$2, where $n$3 is the support of a generator-matrix column, are dependent. Blind interleaving schemes BI-DP and BI-CDP fully scatter outer-code bits across polar blocks, whereas correlation-breaking interleaving (CBI) only separates the polar positions identified as correlated through the row-weight structure of $n$4. In the reported LDPC$n$5+polar$n$6 example, CBI with SC decoding achieves a $n$7 gain over direct concatenation with SC and a $n$8 gain over direct concatenation with BP at BER $n$9, while using less memory and delay than blind interleaving (Meng et al., 2017).

In deployed terrestrial free-space optical communication, interleaving is again a fade-spreading mechanism. On a $x\in X_0\circledast\cdots\circledast X_{n-1}$0 urban coherent FSO link in Eindhoven, symbol-wise block interleaving with transmitter write-row/read-column and receiver write-column/read-row is reported to reduce outage probability by about two orders of magnitude. For strong turbulence $x\in X_0\circledast\cdots\circledast X_{n-1}$1, the paper states that at least $x\in X_0\circledast\cdots\circledast X_{n-1}$2 interleaving is required to achieve $x\in X_0\circledast\cdots\circledast X_{n-1}$3 at decoded data rates above $x\in X_0\circledast\cdots\circledast X_{n-1}$4. The latency cost is explicitly $x\in X_0\circledast\cdots\circledast X_{n-1}$5 for interleaver length $x\in X_0\circledast\cdots\circledast X_{n-1}$6 (Gümüş et al., 15 Jun 2026).

4. Compression, scheduling, and memory behavior

In entropy coding, interleaving means running multiple coders with separate internal states over a single shared bitstream without explicit side metadata. This works especially naturally for streaming ANS/ABS coders because encoder and decoder traverse the same states in reverse temporal order. With coding and decoding maps

$x\in X_0\circledast\cdots\circledast X_{n-1}$7

normalization interval

$x\in X_0\circledast\cdots\circledast X_{n-1}$8

and $x\in X_0\circledast\cdots\circledast X_{n-1}$9-uniqueness of precursor sets $x_jx_{j+n}x_{j+2n}\ldots$0, the encoder’s emits and the decoder’s reads are synchronized exactly. The paper reports scalar 2-way speedups around $x_jx_{j+n}x_{j+2n}\ldots$1 to $x_jx_{j+n}x_{j+2n}\ldots$2, and SIMD speedups exceeding $x_jx_{j+n}x_{j+2n}\ldots$3, while noting that arbitrary entropy coders require an instrumented decoder and extra buffering to obtain metadata-free interleaving (Giesen, 2014).

In process algebra, interleaving appears first as arbitrary interleaving in ACP and then as scheduler-constrained interleaving. Standard ACP parallel composition satisfies

$x_jx_{j+n}x_{j+2n}\ldots$4

so every admissible next step from the left, right, or a communication is present. Strategic interleaving replaces that symmetry by a scheduler

$x_jx_{j+n}x_{j+2n}\ldots$5

and a control-state transformer

$x_jx_{j+n}x_{j+2n}\ldots$6

The extension $x_jx_{j+n}x_{j+2n}\ldots$7 supports history-dependent and state-dependent scheduling and proves elimination, conservative extension, and unique expansion properties (Bergstra et al., 2017). A probabilistic variant, $x_jx_{j+n}x_{j+2n}\ldots$8, adds probabilistic choice $x_jx_{j+n}x_{j+2n}\ldots$9 and extends strategic interleaving to probabilistic process-scheduling policies, while maintaining the principle that probabilistic choices are resolved before ordinary alternative or parallel choices are resolved (Middelburg, 2019).

In memory-security systems, interleaving denotes a freshness-preserving memory layout transformation. Zebrafix interleaves an $X_j$0-byte counter with an $X_j$1-byte payload inside each $X_j$2-byte encrypted memory block: $X_j$3 Because the full block changes on every write, deterministic address-tweaked memory encryption no longer reveals equality of repeated plaintexts at the same address, and silent-store leakage is also prevented. With an $X_j$4-byte counter, the paper states that a repetition occurs only after $X_j$5 write accesses. The implementation reports about $X_j$6 average runtime overhead, about $X_j$7 average code-size increase, and roughly $X_j$8 average memory usage increase (Pätschke et al., 13 Feb 2025).

5. Evaluation, learning, and schema inference

In online ranking evaluation, interleaving means combining two rankings into a single displayed list and attributing clicks to the ranker that supplied each clicked item. The paper analyzes an Interleaving Method for Analysis (IMA) and shows that interleaving is not inherently more efficient than A/B testing. Under constant examination independent of relevance, the expected preference gap and total variance are equal, so the decision error probability is the same. Under relevance-aware abandonment,

$X_j$9

with $0\le j\le n-1$00 monotonically decreasing, interleaving both enlarges the expected click-gap and reduces the total variance, making it more efficient than A/B testing (Iizuka et al., 2023).

In machine learning, interleaving is used as a training protocol rather than a permutation of symbols. Interleaving learning (IL) cycles a shared encoder through $0\le j\le n-1$01 learners over $0\le j\le n-1$02 rounds, regularizing each learner’s encoder toward the encoder optimized by the previous learner: $0\le j\le n-1$03 The resulting optimization is multi-level, with architecture $0\le j\le n-1$04 updated by validation loss after the final round. In differentiable NAS on CIFAR-10/CIFAR-100 and transfer to ImageNet, the paper reports consistent improvements over corresponding DARTS/P-DARTS/PC-DARTS and multitask baselines; for example, IL-PDARTS reaches $0\le j\le n-1$05 error on CIFAR-100 and $0\le j\le n-1$06 top-1 error on ImageNet in the reported tables (Ban et al., 2021).

In XML schema inference, interleaving is part of the target language. The paper introduces ISIREs, an improved subclass of regular expressions with interleaving, generated by

$0\le j\le n-1$07

with the restriction that each symbol occurs at most once. Inference proceeds by extracting partial-order constraints, decomposing a graph via repeated approximate maximum independent sets, topologically sorting consistent-order blocks, and then constructing a generalized single occurrence automaton. The resulting algorithm InferISIRE runs in

$0\le j\le n-1$08

where $0\le j\le n-1$09 is alphabet size and $0\le j\le n-1$10 is the total sample length. On the reported datasets, the inferred expressions have lower language size, lower data encoding cost, and lower combinatorial cardinality than the compared baselines (Dong et al., 2019).

6. Limits, trade-offs, and computational hardness

Interleaving is often treated as a universally beneficial regularization or reliability device, but the literature is more qualified. In symbolic dynamics it is neither commutative nor associative in general (Abram et al., 2021). In persistence-based dimensionality reduction, the guaranteed correspondence is explicitly algebraic: the authors warn that there need not exist topological maps $0\le j\le n-1$11 and $0\le j\le n-1$12 inducing the interleaving, even when the interleaving distance is zero (Nelson et al., 2022). In entropy coding, metadata-free interleaving is natural for ANS but not generic; arbitrary coders need decoder simulation, temporary buffers, and periodic flushes to control worst-case memory (Giesen, 2014).

The communication literature shows an equally sharp trade-off. Interleaving is indispensable against correlated fades and burst errors in many settings, yet matched decoding for bursty channels can make interleavers unnecessary or even counterproductive because buffering and de-interleaving add latency while destroying exploitable structure (An et al., 2020, Gümüş et al., 15 Jun 2026). In ranking evaluation, interleaving is more sample-efficient only under relevance-dependent abandonment, not under constant examination (Iizuka et al., 2023).

The theory of interleaving distance also has strong negative complexity results. For one-parameter pointwise finite-dimensional persistence modules over $0\le j\le n-1$13, the isometry theorem yields polynomial-time computation via bottleneck distance. Beyond that regime, the paper proves that deciding interleaving can be NP-hard or worse: for $0\le j\le n-1$14-valued modules over a generalized poset $0\le j\le n-1$15, $0\le j\le n-1$16-interleaving is NP-complete; for $0\le j\le n-1$17, the problem is at least as hard as constrained matrix invertibility; for $0\le j\le n-1$18, the $0\le j\le n-1$19 case is GI-complete, implying that Reeb graph isomorphism is graph-isomorphism complete (Bjerkevik et al., 2017).

These results suggest a broad but precise conclusion. Interleaving is not a single operation but a structural principle: it alternates components while preserving designated local relations. Its value depends on what is preserved, what is decorrelated, what is synchronized, and what computational or latency cost is incurred.