--- title: 'Position-Estimation Codes: Methods & Applications' url: https://www.emergentmind.com/topics/position-estimation-codes type: topic --- # Position-Estimation Codes: Methods & Applications Searching arXiv for relevant papers on position-estimation codes, position coding, and related estimation-code design. Position-estimation codes denote code constructions in which a constrained observation is engineered to identify a location, a short location interval, or another position-related latent variable. In one classical discrete-mathematical sense, a position coding pattern is “an array of symbols in which subarrays of a certain fixed size appear at most once,” so a local window can be decoded into coordinates [0706.0869]. In deletion-correcting coding theory, a position-estimation component approximates error positions before a local correction stage reconstructs the deleted symbols [2507.04797]. A broader engineering usage also appears in sensing and wireless estimation, where designed tag responses or spatial pilot patterns function as codes that improve orientation or position recovery [2112.00883]. ## 1. Scope and formal interpretations The literature uses closely related terminology in several technically distinct ways. The common thread is not a single channel model or decoder architecture, but the deliberate design of observable structure so that positional information can be inferred from partial data. In discrete patterns, the observation is a local subarray. In deletion correction, the observation is a corrupted word from which a short corruption interval must be inferred. In sensing-oriented design, the observation is a measured response induced by a deliberately chosen probing structure such as a tag response or a spatial pilot pattern [0706.0869]. A concise way to separate the main traditions is to distinguish the coordinate-decoding, error-localization, and probing-design viewpoints. The first decodes physical coordinates from local combinatorial uniqueness; the second localizes corruption in symbol sequences; the third designs measurement structure so that geometric state estimation is more accurate. The end-to-end mmWave positioning literature makes this third usage explicit by stating that the transmitter precoder is the “code” that shapes the spatial probing signal, while the receiver network is the estimator [2209.12818]. | Family | Observation | Decoded quantity | |---|---|---| | Position coding pattern | Fixed-size local subarray | Coordinate | | Error-position-estimation code | Sequence after deletions | Short interval containing corruption | | Estimation-oriented probing code | Tag or pilot response | Position or orientation estimate | This taxonomy also prevents a common ambiguity. “Position” may refer either to a physical location in a 2D or 3D coordinate system or to the position of an error event in a symbolic sequence. Both usages are well established in the cited literature [2507.04797]. ## 2. Local uniqueness and the combinatorics of coordinate recovery The foundational definition in the combinatorial literature is the position coding pattern: an array in which every subarray of a prescribed size appears at most once. If a fixed-size window is unique, then observing that window identifies where it came from. The stronger exact-uniqueness analogue is the De Bruijn torus: an \((R,S;m,n)_k\)-De Bruijn torus is a two-dimensional toroidal array with \(R\) rows and \(S\) columns in which every \(m\times n\) array over a \(k\)-symbol alphabet appears exactly once [0706.0869]. The decoding philosophy is correspondingly uniform. A coordinate is encoded into a structured local pattern; a reader acquires a small subarray; the subarray is matched to a canonical pattern class; and the coordinate is reconstructed by lookup or algebraic inversion. In the non-wavelet construction, the notation \[ Z(i,j;m,n)= \left[ \begin{array}{cc} Z_{i,j} & Z_{i,j+n}\\ Z_{i+m,j} & Z_{i+m,j+n} \end{array} \right] \] is used to extract \(2\times 2\) subarrays and decode them by parity and lookup [0706.0869]. The classical industrial exemplar discussed in this literature is the Anoto pattern used in the Fly Pentop system. Its dots lie on a raster, but each dot is slightly offset in one of four possible directions, and the pattern has the property that any \(6\times 6\) array of dots appears only once. Each dot offset contributes one bit to the \(x\)-coordinate and one bit to the \(y\)-coordinate. The construction is organized around a cyclic binary main number sequence of length \(63\), which is a quasi De Bruijn sequence of order \(6\) [0706.0869]. A key intermediate object is the primary difference sequence. If adjacent columns are shifted by \(\ell\) and \(m\), the difference is \[ d_k=\ell-m \pmod{63}. \] The allowed values are then restricted to \(\{5,\ldots,58\}\), and an explicit bijection \[ \phi:\{5,\ldots,58\}\to \{0,1,2\}\times \{0,1,2\}\times \{0,1\}\times \{0,1,2\} \] is defined by \[ r=5+a_1+a_2\cdot 3+a_3\cdot 3^2+a_4\cdot 2\cdot 3^2, \qquad \phi(r)=(a_1,a_2,a_3,a_4). \] These secondary sequences yield a multi-level digit decomposition of the coordinate. The paper further notes that \[ \operatorname{lcm}(236,233,31,241)=236\cdot 233\cdot 31\cdot 241=410815348, \] which quantifies the repetition period of the combined secondary structure [0706.0869]. ## 3. Binary constructions: wavelet and non-wavelet designs Two new binary constructions in the same line of work make the design principles more explicit. The first is a binary wavelet-based position coding pattern using the matrix \[ T= \begin{bmatrix} 1&0&1&1\\ 1&1&1&0\\ 1&1&0&0\\ 0&0&1&1 \end{bmatrix}. \] For a \(4\times 4\) matrix \(F\), the transform is \(TFT^t\). Coordinates are encoded into a \(4\times 4\) block in which the top two rows encode the \(x\)-coordinate and the bottom two rows encode the \(y\)-coordinate; the stored page pattern is obtained by applying the inverse transform. This code represents positions from \((0,0)\) through \((255,255)\), hence \(256\times 256=65536\) positions, and appears as a \(1024\times 1024\) binary matrix. Its main stated limitation is that it requires gridlines or some form of delimiters to distinguish individual matrices [0706.0869]. The second construction is a delimiter-free non-wavelet binary code. For even \(m\) and \(n\), the paper states that one can create a binary position coding pattern in which \(m\times n\) sections are unique; the explicit construction is a \(48\times 576\) binary array in which every \(4\times 4\) section appears at most once. It is built from a fixed \[ U= \left[ \begin{array}{cc} 1&0\\ 0&0 \end{array} \right], \] a sequence \(A\) of \(12\) distinct \(2\times 2\) arrays, and a derived sequence \(B\) formed by combining the second column of one block with the first column of the next [0706.0869]. Decoding proceeds by isolating parity information and then applying lookup tables. A distinguished set \[ R= \left\{ \left[\begin{array}{cc}1&0\\0&0\end{array}\right], \left[\begin{array}{cc}0&1\\0&0\end{array}\right], \left[\begin{array}{cc}0&0\\1&0\end{array}\right], \left[\begin{array}{cc}0&0\\0&1\end{array}\right] \right\} \] identifies the within-block offset, because exactly one \(2\times 2\) subblock of a \(4\times 4\) window lies in \(R\). The remaining \(2\times 2\) blocks are decoded by membership in \(A\), \(B\), or transformed versions of them. The coordinate decomposition is explicit: the \(x\)-coordinate is represented by two base-\(12\) digits plus a residue class modulo \(4\), and the \(y\)-coordinate is represented analogously [0706.0869]. These binary constructions clarify an important point about position-estimation codes in the combinatorial sense: local uniqueness alone is not the entire design problem. Self-delimitation, parity localization, and low-complexity decoding tables are equally central. The wavelet design has clean algebraic structure but needs delimiters, whereas the non-wavelet construction integrates localization of the reading frame into the code itself. ## 4. Error-position-estimation codes for deletion channels A second major meaning of position-estimation code arises in deletion correction. The coding-theoretic problem is not to recover physical coordinates but to localize where deletions occurred. The paper on bursty and localized deletions states that existing constructions employ a position-estimation component to approximate error positions, augmented by additional constraints that enable error-correction given the information about error positions. The new contribution is a position-estimation mechanism based on differential sequences whose differential sequences are strong-\((\ell,\epsilon)\)-locally-balanced [2507.04797]. Two adversarial models are considered. A \((\le t)\)-burst-deletion deletes a contiguous substring of length at most \(t\). A \(t\)-localized deletion deletes at most \(t\) symbols inside an unknown window of length \(t\). In both models, the critical first step is to determine a short interval containing the corruption; once the location is narrowed to a window of length \(O(\log n)\), a separate local code can recover the deleted symbols [2507.04797]. The central algebraic device is the differential sequence transform. For \(\mathbf{x}\in\Sigma_q^n\), \[ \psi(\mathbf{x}) \triangleq DVT(0\mathbf{x}), \] with \[ \psi(\mathbf{x})_i = (x_{i-1}-x_i)\pmod q,\qquad 1\le i\le n+1, \] when \(x_0=x_{n+1}=0\). This map is invertible and is a bijection onto \[ \left\{\mathbf{y}\in\Sigma_q^{n+1}: Sum(\mathbf{y})\equiv 0 \pmod q\right\}. \] A single deletion in \(\mathbf{x}\) becomes a local replacement in \(\psi(\mathbf{x})\): two adjacent symbols \(y_i y_{i+1}\) are replaced by their mod-\(q\) sum \(y_i\oplus y_{i+1}\). That locality is the key simplification [2507.04797]. The balance condition is then imposed in the differential domain. A sequence is strong-\((\ell,\epsilon)\)-locally-balanced if every substring of length \(\ell'\ge \ell\) has \(L_1\)-weight in \[ \left[\left(\frac{q-1}{2}-\epsilon\right)\ell',\ \left(\frac{q-1}{2}+\epsilon\right)\ell'\right]. \] This prevents long substrings from being too light or too heavy. In the decoding analysis, such bounds force any candidate index \(j\) consistent with the VT-derived equations to lie close to the true deletion location; otherwise the implied interval weight contradicts local balance [2507.04797]. Two further constraints turn localization into a code. The first is a VT-type constraint \[ VT(\psi(\mathbf{x}))\equiv b \pmod N, \qquad VT(\mathbf{y})=\sum_{i=1}^n i y_i. \] The second is an \(L_1\)-weight congruence constraint \[ Sum(\psi(\mathbf{x}))\equiv c\cdot q \pmod{(t+1)q}. \] The final burst-deletion code is \[ \mathcal{C}_{\le t}=\left\{\mathbf{x}\in\Sigma_q^n: \begin{array}{l} \psi(\mathbf{x})\text{ is strong-}(\ell,\epsilon)\text{-locally-balanced},\\ f_{P,t',0}(\mathbf{x})=a_{t'}\ \forall\,2\le t'\le t,\\ VT(\psi(\mathbf{x}))\equiv b\pmod N,\\ Sum(\psi(\mathbf{x}))\equiv c\cdot q\pmod{(t+1)q} \end{array} \right\}, \] where \(P=\ell+t-1\). The decoder uses the VT and sum constraints to derive \(\Delta\) and \(\Delta_{sum}\), scans backward for a consistent index \(j\), proves that \(j\) lies within \(\ell\) of the true location, and then reduces the problem to \(P\)-bounded local burst-error correction [2507.04797]. The redundancy improvement is explicit. For fixed \(q\) and \(t\), when \(q\ge 2\) and \(t