相关论文: Angle Between Two Vectors over Finite Fields and a…

Projective metrics on vector spaces over finite fields, introduced by Gabidulin and Simonis in 1997, generalize classical metrics in coding theory like the Hamming metric, rank metric, and combinatorial metrics. While these specific metrics…

The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…

Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in…

Independent parallel q-ary symmetric channels are a suitable transmission model for several applications. The proposed weighted-Hamming metric is tailored to this setting and enables optimal decoding performance. We show that some…

The setting of projective systems can be used to study the parameters of a projective linear code $\mathcal{C}$. This can be done by considering the intersections of the point set $\Omega$ defined by the columns of a generating matrix for…

The aim of this paper is to present an original approach that takes advantage from the geometric features of strictly convex functions to tackle the problem of finding the minimum from another perspective. The general idea is that near the…

Let $\bar{\Gamma}$ be the point-hyperplane geometry of a projective space $\mathrm{PG(V)},$ where $V$ is a $(n+1)$-dimensional vector space over a finite field $\mathbb{F}_q$ of order $q.$ Suppose that $\sigma$ is an automorphism of…

When reasoning about tasks that involve large amounts of data, a common approach is to represent data items as objects in the Hamming space where operations can be done efficiently and effectively. Object similarity can then be computed by…

The problem of error-control in random linear network coding is considered. A ``noncoherent'' or ``channel oblivious'' model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer…

This paper is a detailled study of the coding of real trees by real valued functions that is motivated by probabilistic problems related to continuum random trees. Indeed it is known since the works of Aldous (1993) and Le Gall (1991) that…

Using commutative algebra methods we study the generalized minimum distance function (gmd function) and the corresponding generalized footprint function of a graded ideal in a polynomial ring over a field. The number of solutions that a…

Neural shape representation generally refers to representing 3D geometry using neural networks, e.g., computing a signed distance or occupancy value at a specific spatial position. In this paper we present a neural-network architecture…

We give a quantum reduction from finding short codewords in a random linear code to decoding for the Hamming metric. This is the first time such a reduction (classical or quantum) has been obtained. Our reduction adapts to linear codes…

In a real Hilbert space $\mathcal{H}$. Given any function $f$ convex differentiable whose solution set $\argmin_{\mathcal{H}}\,f$ is nonempty, by considering the Proximal Algorithm $x_{k+1}=\text{prox}_{\b_k f}(d x_k)$, where $0<d<1$ and…

Bent functions, or equivalently, Hadamard difference sets in the elementary Abelian group $(\gf(2^{2m}), +)$, have been employed to construct symmetric and quasi-symmetric designs having the symmetric difference property. The main objective…

We present a new general method for performing basic arithmetic in the finite field~$\mathbb{F}_p$ for any prime $p>2$ by using traditional binary operations over~$\mathbb{F}_2$. Our new approach is efficient and competitive with current…

A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov- Trifonov bound in a similar way as the Hartmann-Tzeng bound extends…

Linear codes over finite fields parameterized by functions have proven to be a powerful tool in coding theory, yielding optimal and few-weight codes with significant applications in secret sharing, authentication codes, and association…

We introduce a rotation-invariant representation of planar shapes. In particular, this representation encodes shapes as vectors such that the Euclidean distance between them serves as a valid shape distance. For standardized, star-shaped…

Singular vectors are those for which the quality of rational approximations provided by Dirichlet's Theorem can be improved by arbitrarily small multiplicative constants. We provide an upper bound on the Hausdorff dimension of singular…