Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.26649

A study of the $m$th relative Feng-Rao distances with a special emphasis on $C_{ab}$ curves

Eduardo Camps-Moreno·Olav Geil·Hiram H. López·Gretchen L. Matthews·Rodrigo San-José
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the seminal paper [13], Farrán and Munuera introduced a method to establish generic information on the $m$th Feng-Rao distance via a function on arbitrary numerical semigroups that serves as a lower bound on the generalized Hamming weights of dual one-point algebraic geometry codes whenever the semigroup is Weierstrass. In the present paper, we study what we shall call the primary and dual, respectively, $m$th relative Feng-Rao distances, which serve as lower bounds on relative generalized Hamming weights of nested primary and dual, respectively, one-point codes under similar condition. A unified method for establishing generic formulas for $m$th relative Feng-Rao distances of general numerical semigroups is developed and for a large variety of numerical semigroups generated by two elements, closed formula expressions are established complementing Delgado et al.s work [8] on the $m$th Feng-Rao distances of such semigroups. Finally, for non-singular $C_{ab}$ curves, we develop a method to estimate the $m$th relative generalized Hamming weight of dual and primary one-point codes in those regions where the generic methods may fail to provide best possible results.

Explore related subjects

cs.ITmath.AGmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eduardo Camps-Moreno, Olav Geil, Hiram H. López, Gretchen L. Matthews, Rodrigo San-José. 2026-10-19. A study of the $m$th relative Feng-Rao distances with a special emphasis on $C_{ab}$ curves. https://arxiv.org/abs/2610.26649

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Asymmetric Hamming Bidistance and Distributions over Binary Asymmetric Channels

The binary asymmetric channel is a model for practical communication systems where the error probabilities for symbol transitions $0\rightarrow 1$ and $1\rightarrow0$ differ substantially. In this paper, we introduce the notion of asymmetric Hamming bidistance (AHB) and its two-dimensional distribution, which separately captures directional discrepancies between codewords. This finer characterization enables a more discriminative analysis of decoding the error probabilities for maximum-likelihood decoding (MLD), particularly when conventional measures, such as weight distributions and existing discrepancy-based bounds, fail to distinguish code performance. Building on this concept, we derive a new upper bound on the average error probability for binary codes under MLD and show that, in general, it is incomparable with the two existing bounds derived by Cotardo and Ravagnani (IEEE Trans. Inf. Theory, 68 (5), 2022). To demonstrate its applicability, we compute the complete AHB distributions for several families of codes, including two-weight and three-weight projective codes (with the zero codeword removed) via strongly regular graphs and 3-class association schemes, as well as nonlinear codes constructed from symmetric balanced incomplete block designs (SBIBDs).

cs.IT↗
arXiv2026

The Closure of LCD-to-GI Reductions via Generalized Inner Products

The Permutation Equivalence Problem (PEP) for linear complementary dual (LCD) codes reduces to Graph Isomorphism (GI) through the orthogonal projector onto the code, but this requires a trivial hull. We ask whether the reduction extends when the standard inner product is replaced by a nondegenerate symmetric bilinear form \(M\). We make precise what it means for \(M\) to yield a valid reduction to GI and prove that, for length \(n \geq 3\) and every field size, this holds if and only if \(M\) is permutation-invariant. The reduction then reaches, beyond LCD codes, a class of codes with one-dimensional hull: exactly those whose hull is spanned by a vector with nonzero coordinate sum. We count these codes exactly; for odd \(q\), asymptotically the method covers a fraction \(\prod_{i \geq 2}(1+q^{-i})^{-1}\) of all codes, \(1 + q^{-1}\) times the fraction of LCD codes. A polynomial-time reduction algorithm is given.

cs.IT↗
arXiv2026

On the Role of Normalization in Binary Iterative Hard Thresholding for 1-bit Compressed Sensing

Binary Iterative Hard Thresholding (BIHT) is a simple, yet effective, greedy method for recovering a sparse vector from one-bit sign measurements. In its original form, BIHT performs a ``gradient-descent'' step, followed by hard thresholding. A convergence analysis of this algorithm was left open in the introductory work of Jacques, Laska, Boufounos, and Baraniuk [IEEE Trans. Inform. Theory (2013)] and has remained unresolved for over a decade, with subsequent sharp analyses studying a {\em normalized variant} instead, that additionally projects every iterate onto the unit sphere. This paper resolves that gap and characterizes when per-iteration normalization is algorithmically necessary. In the noiseless setting, we prove a universal, sample-optimal convergence theorem for the original BIHT algorithm. Specifically, with $\widetilde O(s/ε)$ measurements, a deterministic, computable finite-time iterate has directional error at most $ε$, simultaneously for every $s$-sparse unit vector. This matches the optimal sample dependence achieved by normalized BIHT in prior work. Under sign corruptions, we prove a sharp separation. If at most a $τ$ fraction of signs are flipped adversarially, then BIHT, without per-iterate normalization, still reaches the robust error floor at an early iterate with a matching $\widetilde O(s/ε)$ sample complexity rate as its normalized variant. This recovery, however, is not stable. We prove a scalar lower bound showing that any nontrivial corruption pattern, even one that involves only one flipped sign together with one clean sign, forces the iterates to oscillate indefinitely. Consequently, no general last-iterate convergence theorem can hold for BIHT under sign corruptions, while its normalized surrogate provably escapes this instance.

cs.IT↗