English
Related papers

Related papers: Hamming distances from a function to all codewords…

200 papers

In this note, we prove multiplicity one theorems for generalized modular functions (GMF), in terms of their q-exponents, and make a general statement about the nature of values that the prime q-exponents of a GMF can take. We shall also…

Number Theory · Mathematics 2016-02-01 Narasimha Kumar

The aim of this work is to give degree formulas for the generalized Hamming weights of evaluation codes and to show lower bounds for these weights. In particular, we give degree formulas for the generalized Hamming weights of…

Commutative Algebra · Mathematics 2020-05-20 Delio Jaramillo , Maria Vaz Pinto , Rafael H. Villarreal

A linear code over $\mathbb{F}_q$ with the Hamming metric is called $\Delta$-divisible if the weights of all codewords are divisible by $\Delta$. They have been introduced by Harold Ward a few decades ago. Applications include subspace…

Information Theory · Computer Science 2025-12-23 Sascha Kurz

The perimeter and area generating functions of exactly solvable polygon models satisfy q-functional equations, where q is the area variable. The behaviour in the vicinity of the point where the perimeter generating function diverges can…

Statistical Mechanics · Physics 2008-08-28 C. Richard , A. J. Guttmann

We derive completeness criteria for sequences of functions of the form $% f(x\lambda_{n})$, where $\lambda_{n}$ is the $nth$ zero of a suitably chosen entire function. Using these criteria, we construct systems of nonorthogonal…

Classical Analysis and ODEs · Mathematics 2009-11-11 Luis Daniel Abreu

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…

Commutative Algebra · Mathematics 2019-10-23 Manuel Gonzalez-Sarabia , Jose Martínez-Bernal , Rafael H. Villarreal , Carlos E. Vivares

We show how the theory of affine geometries over the ring ${\mathbb Z}/\langle q - 1\rangle$ can be used to understand the properties of toric and generalized toric codes over ${\mathbb F}_q$. The minimum distance of these codes is strongly…

Information Theory · Computer Science 2017-03-08 John B. Little

This investigation pertains to the construction of a class of generalised deformed derivative operators which furnish the familiar finite difference and the q-derivatives as special cases. The procedure involves the introduction of a linear…

Quantum Algebra · Mathematics 2009-11-10 Dayanand Parashar , Deepak Parashar

Permutation polynomials with explicit constructions over finite fields have long been a topic of great interest in number theory. In recent years, by applying linear translators of functions from $\mathbb{F}_{q^n}$ to $\mathbb{F}_q$, many…

Number Theory · Mathematics 2025-02-27 Xuan Pang , Pingzhi Yuan , Hongjian Li

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

Number Theory · Mathematics 2019-01-11 F. E. Brochero Martínez , Lucas Reis , Lays Silva

The differential-reduction algorithm, which allows one to express generalized hypergeometric functions with parameters of arbitrary values in terms of such functions with parameters whose values differ from the original ones by integers, is…

High Energy Physics - Theory · Physics 2010-05-19 Vladimir V. Bytev , Mikhail Yu. Kalmykov , Bernd A. Kniehl

We obtain the following results. For any prime $q$ the minimal Hamming distance between distinct regular $q$-ary bent functions of $2n$ variables is equal to $q^n$. The number of $q$-ary regular bent functions at the distance $q^n$ from the…

Information Theory · Computer Science 2023-03-30 Vladimir N. Potapov

This article is centered around generalizing a previous implicit function theorem of the author to be applicable for maps f:E sqcap F to F which can be lifted to Keller C^k_pi maps f_i:E sqcap F_i to F_i with F_i Banach and F=projlim F_i .…

Functional Analysis · Mathematics 2007-05-23 Seppo I Hiltunen

Let $\mu_{q+1}$ denote the set of $(q+1)$-th roots of unity in $\mathbb{F}_{q^2 }$. We construct permutation polynomials over $\mathbb{F}_{q^2}$ by using rational functions of any degree that induce bijections either on $\mu_{q+1}$ or…

Combinatorics · Mathematics 2018-02-15 Daniele Bartoli , Ariane M. Masuda , Luciane Quoos

We express some general type of infinite series such as $$ \sum^\infty_{n=1}\frac{F(H_n^{(m)}(z),H_n^{(2m)}(z),\ldots,H_n^{(\ell m)}(z))} {(n+z)^{s_1}(n+1+z)^{s_2}\cdots (n+k-1+z)^{s_k}}, $$ where $F(x_1,\ldots,x_\ell)\in\mathbb…

Number Theory · Mathematics 2022-02-09 Kwang-Wu Chen

Finite hypergeometric functions are functions of a finite field ${\bf F}_q$ to ${\bf C}$. They arise as Fourier expansions of certain twisted exponential sums and were introduced independently by John Greene and Nick Katz in the 1980's.…

Number Theory · Mathematics 2018-05-09 Frits Beukers

We consider the geometric problem of determining the maximum number $n_q(r,h,f;s)$ of $(h-1)$-spaces in the projective space $\operatorname{PG}(r-1,q)$ such that each subspace of codimension $f$ does contain at most $s$ elements. In coding…

Combinatorics · Mathematics 2026-05-01 Jozefien D'haeseleer , Sascha Kurz

We propose a unified approach to $q$-special functions, which are degenerations of basic hypergeometric functions ${}_2\phi_1(a,b;c;q,x)$. We obtain a list of seven different class of $q$-special functions: ${}_2\phi_1, {}_1\phi_1$, two…

Classical Analysis and ODEs · Mathematics 2011-03-29 Yousuke Ohyama

We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…

Functional Analysis · Mathematics 2026-03-24 Vladyslav Babenko , Vira Babenko , Oleg Kovalenko

Reed-Muller codes consist of evaluations of $n$-variate polynomials over a finite field $\mathbb{F}$ with degree at most $d$. Much like every linear code, Reed-Muller codes can be characterized by constraints, where a codeword is valid if…

Computational Complexity · Computer Science 2025-02-24 Omri Gotlib , Tali Kaufman , Shachar Lovett