---
title: Feng-Rao Majority Voting Decoding
url: https://www.emergentmind.com/topics/feng-rao-majority-voting
type: topic
---

# Feng-Rao Majority Voting Decoding

Feng-Rao majority voting is a decoding method attached to the Feng-Rao bound and related order bounds in algebraic geometry, order domain, and evaluation-code settings. In its standard form, it uses information on well-behaving pairs to decode uniquely up to $\left\lfloor \frac{d_{\mathrm{FR}}-1}{2}\right\rfloor$ errors, where $d_{\mathrm{FR}}$ is the designed minimum distance given by the bound. Work on primary codes established that the Feng-Rao bound for dual codes and the analogous Andersen-Geil bound for primary codes are consequences of each other, implying that the Feng-Rao decoding algorithm can be applied to primary codes up to half their designed minimum distance [1210.6722]. Subsequent papers sharpened the associated minimum-distance and generalized-Hamming-weight bounds, and also clarified that improved bounds do not automatically yield a corresponding majority voting decoder in every strengthened setting [1307.3107].

## 1. Historical placement and scope

The Feng-Rao bound was introduced as a strong lower bound for the minimum distance of dual algebraic-geometric codes and, together with that bound, came a decoding algorithm up to half the bound. Andersen and Geil later developed an analogous bound for primary codes, and the relation between the two viewpoints was made explicit by showing that the Feng-Rao bound for dual codes and Andersen and Geil’s bound for primary codes are consequences of each other [1210.6722].

This equivalence is operationally significant. It implies that the Feng-Rao decoding algorithm can be applied to decode primary codes up to half their designed minimum distance, and the technique applies to any linear code for which information on well-behaving pairs is available. The same source emphasizes that this gives efficient decoding for a large class of codes for which no non-trivial decoding algorithm was previously known, including important families of multivariate polynomial codes [1210.6722].

The literature represented here also places Feng-Rao majority voting inside a broader hierarchy of order-bound methods. For primary codes, Matsumoto and Miura derived from the Feng-Rao bound a bound for primary one-point algebraic geometric codes and showed how to decode up to what is guaranteed by their bound, while the primary-code formulation in [1210.6722] avoids the differential-based exposition associated with that earlier treatment. For dual codes, later work by Salazar, Dunn and Graham, and then further improvements in [1305.1091], extended the range of combinatorial structures used to sharpen the underlying distance estimates.

## 2. Combinatorial infrastructure: bases, products, and well-behaving pairs

The basic setup uses bases of $\mathbb{F}_q^n$. If $B=\{b_1,\ldots,b_n\}$ is a basis and $I\subseteq\{1,\ldots,n\}$, then the primary code is
\[
C(B,I)=\operatorname{span}_{\mathbb{F}_q}\{b_i\mid i\in I\}.
\]
With a second basis $U=\{u_1,\ldots,u_n\}$, the componentwise product is
\[
(u_1,\ldots,u_n)*(v_1,\ldots,v_n)=(u_1v_1,\ldots,u_nv_n),
\]
and if $L_i=\operatorname{span}\{b_1,\ldots,b_i\}$, then $\rho_B(v)=l$ when $v\in L_l\setminus L_{l-1}$ [1210.6722].

An ordered pair $(i,j)$ is well-behaving (WB) with respect to $(B,U)$ if
\[
\rho_B(b_u*u_v)<\rho_B(b_i*u_j)\quad \text{for all }u<i,\ v<j.
\]
The same source also records the relaxed notions WWB and OWB. These combinatorial objects control both lower bounds on minimum distance and the majority voting mechanism itself [1210.6722].

For dual codes,
\[
d(C^+(B,I)) \geq \min \{ M_{WB}^{(B,U)}(l) \mid l \notin I \},
\]
where
\[
M_{WB}^{(B,U)}(l)=\#\{(i,j):\rho_B(b_i*u_j)=l\ \text{and}\ (i,j)\ \text{WB}\}.
\]
For primary codes,
\[
d(C(B,I)) \geq \min \{ N_{WB}^{(B,U)}(i) \mid i \in I \},
\]
where
\[
N_{WB}^{(B,U)}(i)=\#\{j:\exists u_j\in U,\ (i,j)\ \text{WB},\ \rho_B(b_i*u_j)=i\}.
\]
The primary-code interpretation given in [1210.6722] is that the minimum distance is controlled by counting, for each index in the support, the number of WB pairs that “cover” it.

Further work on dual codes generalized this combinatorial infrastructure to three bases $\mathcal{U},\mathcal{V},\mathcal{W}$ and promoted one-way well-behaving pairs as the central relaxed notion. In that notation, $(i,j)$ is OWB if
\[
\bar{\rho}_{\mathcal{W}}(\vec{u}_{i'} * \vec{v}_j) < \bar{\rho}_{\mathcal{W}}(\vec{u}_i * \vec{v}_j), \quad \forall i' < i,
\]
and [1305.1091] states that it demonstrates the advantage of working with one-way well-behaving pairs rather than weakly well-behaving or well-behaving pairs.

## 3. Majority voting decoding for primary and dual codes

The majority voting algorithm for primary codes in [1210.6722] is obtained by translating the primary-code problem into the dual-code syndrome framework. If a primary code $C(G,I)$ is given and one receives
\[
r=c+e,\qquad c\in C(G,I),
\]
the first step is to compute a dual basis $H=\{h_1,\ldots,h_n\}$ satisfying
\[
g_i\cdot h_j=\delta_{i,n-j+1}.
\]
Lemma 5, as summarized in the source, transfers WB-pair information from $(G,U)$ to $(H,U)$, so that the dual-code decoding machinery becomes available [1210.6722].

The syndrome stage is then split into known and unknown components. For positions corresponding to $I^c$, the syndrome components
\[
S_i=h_i\cdot e
\]
are known, because $h_i\cdot c=0$ for $i\in I^c$. The remaining unknown syndrome values are recovered iteratively by majority voting. For each unknown syndrome $s_\ell$, one considers candidate WB pairs $(i,j)$ with $\rho_H(h_i*u_j)=\ell$ and enough already known data; each such pair yields a candidate value for $s_\ell$ via the relevant linear constraint, and if the number of errors is up to half $d_{\mathrm{FR}}$, the majority vote yields the correct value [1210.6722].

After all syndromes are determined, the error vector is recovered by solving the resulting linear system. The source states that the algorithm can be implemented in $O(n^3)$ operations, after a potentially more costly one-time preprocessing to compute bases and WB pairings. Structurally, the majority voting step is described there as nearly identical for primary and dual codes, owing to the duality via basis correspondence [1210.6722].

The same paper gives a concrete example with a primary code of dimension $9$ and index set $I=\{1,2,3,5\}$, where an error in one coordinate is recovered by the syndrome-majority mechanism. That example is presented as an instance of the general statement that unique decoding is possible up to
\[
t=\left\lfloor \frac{d_{\mathrm{FR}}-1}{2}\right\rfloor
\]
errors [1210.6722].

## 4. Improved bounds and their decoding implications

The 2013 paper on primary codes introduces a new bound for the minimum distance of a general primary linear code and states that for affine variety codes defined from generalised $C_{ab}$ curves the new bound often improves dramatically on the Feng-Rao bound for primary codes. Its key innovations are case analysis on coefficient positions, the introduction of strongly one-way well-behaving (SOWB) pairs, and a footprint-method generalization based on unions of suitable supersets [1307.3107].

In the notation of that paper, if
\[
\vec{c}=\operatorname{ev}\!\left(\sum_{s=1}^i a_sM_s+I_q\right),\qquad a_i\neq 0,
\]
and $v\geq 0$ is chosen appropriately, then Theorem 3.1 is summarized as
\[
w_H(\vec{c}) \geq \min \left\{ \#\mathcal{L}(1), \ldots, \#\mathcal{L}(v+1) \right\}.
\]
For generalized $C_{ab}$ curves, Theorem 4.3 is reported in the explicit form
\[
w_H(\vec{c}) \geq (a-\alpha_1)(q-\alpha_2)+\epsilon,
\]
where $\epsilon$ is a case-dependent additional term, described as exactly the improvement over the traditional Feng-Rao bound [1307.3107].

The decoding consequence is more limited than the distance improvement. The same source states that the Feng-Rao majority voting decoder corrects up to $\left\lfloor (d_{\mathrm{FR}}-1)/2\right\rfloor$ errors when $d_{\mathrm{FR}}$ comes from the original well-behaving version of the bound, but that majority voting decoding algorithms are only known for the WB version and do not exist for the SOWB or OWB settings. It therefore identifies as an open problem the construction of a decoding algorithm that can use the extra gain coming from SOWB or the more general footprint bound [1307.3107].

For dual codes, [1305.1091] presents a different strengthening trajectory. It states that the advisory bound of Salazar, Dunn and Graham and the new improvement are lifted so that they deal with generalized Hamming weights, and it also demonstrates the advantage of working with one-way well-behaving pairs rather than weakly well-behaving or well-behaving pairs. The minimum-distance version is summarized there as
\[
w_H(\vec{c}) \geq \max \left\{ \# \mathcal{I}' \;\middle|\; \mathcal{I}' \subseteq \mathcal{I},\ \mathcal{I}' \text{ has the $\mu$-property w.r.t. } m(\vec{c}) \right\}.
\]
A plausible implication is that strengthened order bounds and implementable majority voting decoders must be distinguished carefully: the primary-code SOWB setting in [1307.3107] explicitly lacks a corresponding majority voting algorithm, whereas [1305.1091] frames OWB-based improvements as directly relevant to the decoding radius of Feng-Rao-type majority voting for dual codes.

## 5. Generalized Hamming weights and Feng-Rao numbers

The majority voting paradigm is closely tied to generalized Feng-Rao distances and Feng-Rao numbers. For a numerical semigroup $S$, [1105.4833] defines
\[
d_{FR}^{(r)}(m)=\min \left\{ \#\left( D(m_1)\cup\cdots\cup D(m_r)\right): m\leq m_1<\cdots<m_r,\ m_i\in S \right\},
\]
with
\[
D(x)=\{a\in S: x-a\in S\}.
\]
For large $m$,
\[
d_{FR}^{(r)}(m)=m+1-2g+E(S,r),
\]
where $E(S,r)$ is the $r$-th Feng-Rao number. The same source states that these quantities are introduced as lower bounds on generalized Hamming weights for algebraic geometry codes and play a key role in Feng-Rao majority voting decoding [1105.4833].

For semigroups generated by an interval,
\[
S=\langle a,a+1,\ldots,a+b\rangle,\qquad 0<b<a,
\]
[1105.4833] gives a closed formula for $E(S,r)$ and develops the structural theory of amenable sets and ordered amenable sets. Among the conclusions recorded in the source are that an optimal configuration is amenable if and only if it is closed under taking divisors above $m$, and that ordered amenable sets minimize the number of divisors. The same paper states that the explicit computation of $E(S,r)$ yields precise order bounds for code parameters and enables efficient decoding algorithms, because the majority voting threshold depends directly on these values [1105.4833].

The extension to higher weights also appears in the later semigroup papers. For inductive numerical semigroups, the second Feng-Rao number is explicitly computed, and the source states that this number determines the asymptotical behaviour of the order bound for the second Hamming weight of one-point AG codes. In that setting,
\[
E(\Gamma,2)=\min \left\{ b_1+\cdots+b_n+1,\ b_1+\cdots+b_{n-1}+A_n,\ \ldots,\ A_1 \right\},
\]
and for $m\geq c$,
\[
d_2(C_m)\geq m+2-2g+E(\Gamma,2).
\]
The same account adds that Feng-Rao decoding corrects up to half the order bound and that explicit knowledge of $E(\Gamma,2)$ gives provable guarantees in this setting [1505.01395].

For telescopic numerical semigroups, the central result is that the second Feng-Rao number agrees with the multiplicity:
\[
E(\Gamma,2)=n_1.
\]
The same source connects this to the second generalized Hamming weight by
\[
d_2(C_a)\geq a+2-2g+n_1,
\]
and states that this improves upon other estimates such as the Griesmer Order Bound [1603.09301].

## 6. Scope, limitations, and recurrent misconceptions

A recurrent misconception is that Feng-Rao majority voting is confined to classical one-point AG codes. The primary-code formulation in [1210.6722] states instead that the technique applies to any linear code for which information on well-behaving pairs is available, and it explicitly lists important families of multivariate polynomial codes among the classes that thereby become efficiently decodable [1210.6722].

Another recurrent misconception is that every improvement of a Feng-Rao-type lower bound immediately enlarges the actual majority voting decoding radius. The primary-code improvement in [1307.3107] is explicit that, although the new bound can improve minimum distance and generalized Hamming weights dramatically when only order domain condition (C1) holds but not (C2), no majority voting decoding algorithms are known for the SOWB or OWB settings used there. The paper therefore separates improved code parameters from currently available decoding algorithms [1307.3107].

A third misconception is that higher Feng-Rao numbers are only asymptotic bookkeeping devices. The numerical-semigroup literature represented here treats them as operational invariants for generalized Hamming weights and order bounds. The interval-generated, inductive, and telescopic semigroup papers all connect explicit formulas for Feng-Rao numbers to lower bounds for higher Hamming weights and to decoding guarantees phrased in terms of order bounds and majority voting thresholds [1105.4833].

Taken together, these results place Feng-Rao majority voting at the intersection of combinatorial pair structures, duality between primary and dual codes, and semigroup/order-bound asymptotics. Its classical form is algorithmically concrete and polynomial-time, its design radius is governed by WB-based lower bounds, and its modern developments show both the power and the current limits of extending majority logic beyond the original well-behaving framework [1210.6722].

Source: https://www.emergentmind.com/topics/feng-rao-majority-voting