---
title: 'OddEEC: Error Estimating Coding for Wireless Networks'
url: https://www.emergentmind.com/topics/oddeec
type: topic
---

# OddEEC: Error Estimating Coding for Wireless Networks

Searching arXiv for OddEEC and closely related work to ground the article in the relevant literature.
OddEEC is an Error Estimating Coding (EEC) scheme for estimating the number of bit errors during packet transmission over wireless networks. It is introduced as “a novel EEC scheme” that adapts a data sketching technique named Odd Sketch to the EEC setting, with the adaptation centered on a bit sampling technique and a maximum likelihood estimator. In the reported experiments, OddEEC “overall achieves comparable estimation accuracy as competing schemes such as gEEC and mEEC, with much smaller decoding complexity” [2508.11842].

## 1. Definition and problem setting

Error estimating coding is described as “a standard technique for estimating the number of bit errors during packet transmission over wireless networks” [2508.11842]. Within this setting, OddEEC treats packets as bit-strings $P$ and $P'$ of length $l$, and frames the target quantity as the Hamming distance between the transmitted and received packets. The paper states that this Hamming distance is equivalent to the symmetric difference cardinality between the sets corresponding to the indices of 1-bits in the two packets [2508.11842].

This construction places OddEEC at the intersection of wireless error estimation and compact sketching. The underlying sketching primitive is Odd Sketch, originally designed to estimate the Jaccard similarity between two sets $A$ and $B$. In Odd Sketch, a hash function $h: U \to [n]$ assigns elements to positions in an $n$-bit sketch, and bit $i$ is set to 1 iff the set of elements assigned to $i$ has odd size. A key inherited property is that the bitwise XOR $S_A \oplus S_B$ equals the Odd sketch of the symmetric difference set $A \triangle B$ [2508.11842].

In OddEEC, this property is repurposed for error estimation. The transmitter forms a compact codeword from the packet, appends it to the packet, and the receiver compares the codeword derived from the received packet against the appended one. This suggests a design in which the algebra of symmetric difference is used as a proxy for bit-error counting rather than for set-similarity estimation.

## 2. Core construction and estimator

The OddEEC workflow is divided into encoding and decoding stages. On the sender side, the packet $P$ is converted to a set $A$ consisting of the indices of 1-bits, and the Odd sketch $S_P$ is computed and appended as a compact codeword. On the receiver side, the received packet $P'$ is converted to a set $B$, the receiver computes $S_{P'}$, forms the XOR $S_P \oplus S_{P'}$, and counts the number $z$ of 1-bits in that result [2508.11842].

The paper models $z$ as a binomial random variable:
\[
z \sim \mathrm{Bin}(n, p)
\]
with
\[
p = \frac{1 - (1-2/n)^m}{2},
\]
where $n$ is the sketch length and $m$ is the symmetric difference cardinality, equivalently the number of bit errors [2508.11842]. From this model, OddEEC uses a method-of-moments estimator, described “with immunity,”
\[
\hat{m} = -\frac{n}{2} \ln\left(1 - \frac{2z}{n}\right).
\]

This estimator is central to the scheme’s baseline decoding logic. It converts the observed parity-sketch disagreement count into an estimate of the underlying error count. The formulation also makes the saturation behavior explicit: as $z \to n/2$, the logarithm becomes unstable or undefined, limiting the usable error range for a fixed sketch length [2508.11842].

A plausible implication is that OddEEC’s practical effectiveness depends not only on sketch compactness but also on how well the system keeps the operating point away from this saturation regime.

## 3. Bit sampling and saturation control

The paper identifies saturation as a major obstacle for applying a naive Odd sketch directly to long packets or high bit-error-rate (BER) regimes. For large $m$, a fixed-length sketch cannot accurately estimate the error count, because the observable $z$ approaches $n/2$ and the estimator becomes unstable [2508.11842].

OddEEC addresses this using a bit sampling technique. Rather than sketching the full packet, it samples a subset of bits of size
\[
r = \beta l,
\]
where $\beta$ is the sampling rate. Odd sketches are then constructed from the sampled packets. Under this procedure, the Hamming distance after sampling is reduced to
\[
\mu \sim \mathrm{Bin}(m, \beta),
\]
and the estimator is rescaled as
\[
\hat{m} = \frac{\hat{\mu}}{\beta},
\qquad
\hat{\mu} = -\frac{n}{2} \ln\left(1 - \frac{2z}{n}\right)
\]
[2508.11842].

The paper further reports an approximate variance formula:
\[
\mathrm{Var}[\hat{m}]
\approx
\frac{n}{4\beta^2}
\left(
e^{4\beta m/n} - \frac{4\beta m}{n} - 1
\right)
+
\frac{m(1 - \beta)}{\beta}.
\]
This is used for parameter tuning. In practice, the sampling rate is chosen so that
\[
\beta m / n \leq 2/3
\]
“to keep the sketch unsaturated,” and it is tuned based on target packet lengths and anticipated BER [2508.11842].

This part of the construction is the principal mechanism by which OddEEC extends Odd Sketch to the EEC regime. The paper explicitly states that “the new bit sampling scheme replaces Broder’s embedding (which only preserves Jaccard similarity) to directly support Hamming distance estimation” [2508.11842]. That statement is both methodological and conceptual: OddEEC is not merely reusing a sketch, but reengineering its input representation so that the relevant statistic is preserved for wireless error estimation.

## 4. Maximum likelihood estimation under codeword corruption

A defining complication in EEC is that the appended codeword may itself be corrupted during transmission. The paper highlights this as a challenge absent from the original Odd Sketch setting and introduces a maximum likelihood estimator (MLE) to address it [2508.11842].

Let $z^c$ denote the number of 1s in
\[
S_P^c \oplus S_{P'},
\]
where $S_P^c$ is the corrupted transmitted codeword. For an observed value $z^c = \phi$, the MLE estimates the BER $\theta$ by
\[
\hat{\theta} = \argmax_\theta\; \Pr[z^c = \phi \mid \theta].
\]
The likelihood is written as a convolution:
\[
\Pr[z^c = \phi \mid \theta]
= \sum_{k=0}^{n}
\Pr[z = k \mid \theta]
\cdot
\Pr[z^{c} = \phi \mid z = k, \theta],
\]
where
\[
z \sim \mathrm{Bin}(n, p),
\qquad
p = \frac{1 - (1-2\theta/n)^{r}}{2},
\]
and
\[
\Pr[z^c = \phi \mid z=k, \theta]
= \sum_{x}
\binom{k}{x} \binom{n - k}{\phi - x}
(1-\theta)^{n - k - \phi + 2x}
\theta^{k+\phi-2x}.
\]
The paper states that this estimator “can be efficiently implemented as a small lookup table (for $n \leq 96$)” [2508.11842].

The significance of this design is practical as well as statistical. The paper states that OddEEC is “unique among modern EEC schemes in its robustness to codeword corruption,” while also noting that “only OddEEC and gEEC can handle codeword corruption at all; mEEC fails under this scenario” [2508.11842]. It further specifies that this robustness requires “only that the error rates for data and OddEEC bits are matched,” which “can be arranged by mixing codeword bits into the payload” [2508.11842].

This suggests that OddEEC’s estimator is tailored not simply to packet errors in the data field, but to an end-to-end transmission model in which the auxiliary coding bits are exposed to the same channel.

## 5. Multi-resolution design

The paper argues that “no single sampling scale (bit sampling parameter) suffices to cover the entire range of BERs of interest” [2508.11842]. The stated trade-off is that for small BER, a larger sample size reduces quantization error, whereas for large BER, a smaller sample size helps avoid sketch saturation.

To address this, the paper proposes Multi-Resolution OddEEC. The codeword is divided into “two (or more) sub-sketches,” each using a different sampling length or resolution $r_1, r_2$. Each sub-sketch is decoded independently using the MLE corresponding to its own corrupted count $z_i^c$, and the joint likelihood is obtained as the product of likelihoods, yielding a global MLE for the tuple $(z_1^c, z_2^c)$ [2508.11842].

The implementation strategy is explicitly table-driven. The paper states that “all possible combinations of $(z_1^c, z_2^c)$ are precomputed and stored in a small table,” and gives the example that “for $n=48$ per subcode, $24\times 24=576$ entries” suffice, enabling “instant lookup of the best $\hat{\theta}$.” It summarizes the resulting decoding performance as “trivially fast (tens of nanoseconds)” [2508.11842].

This multi-resolution construction is presented as a way to “stitch together” multiple independently tuned subcodes for wide BER-range coverage [2508.11842]. A plausible implication is that the method can be viewed as a composite estimator whose components specialize to different error regimes while sharing the same parity-sketching framework.

## 6. Empirical comparison with gEEC and mEEC

The paper compares OddEEC against gEEC and mEEC along two principal axes: estimation accuracy and decoding complexity [2508.11842]. The most important reported result is that OddEEC “overall achieves comparable estimation accuracy as competing schemes such as gEEC and mEEC, with much smaller decoding complexity” [2508.11842].

For estimation accuracy, the paper distinguishes between single-resolution and two-resolution variants. It reports that Single-Resolution OddEEC “outperforms gEEC in certain BER ranges,” giving examples such as $[0.004, 0.05]$ for smaller $r$ and $[0.001, 0.012]$ for larger $r$, with relative MSE reduced “by factors of up to 2.5.” It also notes that a single-resolution design is worse than gEEC outside the range for which its parameter is tuned [2508.11842]. By contrast, Two-Resolution OddEEC combines small and large $r$ and is reported to have relative MSE and log-MSE “as good or better than gEEC throughout the full range of interest,” while in the evaluated scenarios it is “always within 1.02-1.93$\times$ the gEEC $rMSE$, and often better in practice (factors between 1.2 and 2)” [2508.11842].

Against mEEC, the paper states that OddEEC achieves “essentially the same estimation accuracy as mEEC on codeword-immune (ideal) channel models,” and that “in terms of log-MSE, OddEEC is as good or better across almost all BERs” [2508.11842].

On decoding complexity, the contrast is sharper. The paper states that gEEC’s MLE “depends on the full state (all 96 bits), making the precomputed table intractably large ($2^{96}$ entries),” so “decoding must be done by a CPU in real time—for every packet—which takes tens of milliseconds.” It adds that this “fails real-time requirements,” citing as an example Wi-Fi 6 transmission time of $1.25$ microseconds for a $1500$-byte packet [2508.11842]. For mEEC, the paper states that the required precomputed table size is “~20 MB for typical settings,” and that mEEC “is not robust to codeword (subcode) corruption” [2508.11842]. OddEEC, by contrast, “needs only a small, manageable lookup table (a few kilobytes)” and “enables decoding, by lookup, in tens of nanoseconds” [2508.11842].

The following summary reflects the comparative table reported in the source:

| Scheme | Robust to Codeword Corruption | Decoding Latency |
|---|---:|---:|
| OddEEC | Yes | nanoseconds |
| gEEC | Yes | ms |
| mEEC | No | ns (if immune) |

The paper also characterizes the table-size contrast as follows: OddEEC requires kB-scale precomputation, gEEC has an infeasible precomputed table, and mEEC requires MB-scale tables [2508.11842].

## 7. Novelty, scope, and interpretation

The paper identifies several elements as constituting OddEEC’s novelty. First, it is “a nontrivial adaptation” of Odd Sketch to EEC, with the adaptation explicitly tied to “its bit sampling technique and maximum likelihood estimator” [2508.11842]. Second, the work extends Odd Sketch from symmetric difference cardinality estimation under codeword immunity to “the practical EEC problem (potentially corrupted codeword) via MLE” [2508.11842]. Third, the multi-resolution approach combines multiple subcodes so as to cover a wider BER range than a single parameterization can handle [2508.11842].

From the reported results, the most stable characterization is that OddEEC prioritizes a balance of three properties: comparable estimation accuracy, robustness to codeword corruption, and very low decoding complexity. The paper repeatedly emphasizes that the reduction in runtime and table size is not achieved by discarding probabilistic decoding, but by choosing a sketch representation and likelihood structure whose sufficient statistics are compact enough for precomputation [2508.11842].

A common misconception would be to view OddEEC as merely a direct application of Odd Sketch. The paper argues otherwise: the original Odd Sketch is designed for Jaccard similarity, whereas OddEEC requires direct support for Hamming distance estimation and resilience to corruption of the appended codeword itself [2508.11842]. Another potential misconception would be to treat its performance as uniformly superior to all alternatives in every regime. The reported results are more specific: single-resolution OddEEC is parameter-sensitive and can be worse than gEEC outside tuned regions, while the two-resolution design is used to recover broad-range performance [2508.11842].

In that sense, OddEEC is best understood as a sketch-based EEC framework rather than as a single fixed estimator. Its key components are the Odd-sketch representation, sampling-based control of saturation, and MLE-based decoding under corrupted codewords. Within the reported evaluation, this combination yields “comparable estimation accuracy” to gEEC and mEEC together with “much smaller decoding complexity” [2508.11842].

Source: https://www.emergentmind.com/topics/oddeec