中文
相关论文

相关论文: Generalized Hamming weights of affine cartesian co…

200 篇论文

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…

信息论 · 计算机科学 2017-03-08 John B. Little

A family $f_t(z)$ of polynomials over a number field $K$ will be called \emph{weighted homogeneous} if and only if $f_t(z)=F(z^e, t)$ for some binary homogeneous form $F(X, Y)$ and some integer $e\geq 2$. For example, the family $z^d+t$ is…

数论 · 数学 2017-06-14 Patrick Ingram

Write ${\cal F}$ for the set of homomorphisms from $\{0,1\}^d$ to ${\bf Z}$ which send $\underline{0}$ to 0 (think of members of ${\cal F}$ as labellings of $\{0,1\}^d$ in which adjacent strings get labels differing by exactly 1), and…

组合数学 · 数学 2012-06-15 David Galvin

For any affine hypersurface defined by a complete symmetric polynomial in $k\geq 3$ variables of degree $m$ over the finite field $\mathbb{F}_{q}$ of $q$ elements, a special case of our theorem says that this hypersurface has at least…

数论 · 数学 2020-07-23 Jun Zhang , Daqing Wan

A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…

信息论 · 计算机科学 2025-12-03 Cristina Fernández-Córdoba , Sergi Sánchez-Aragón , Mercè Villanueva

Let $D$ be a Dedekind domain with infinitely many maximal ideals, all of finite index, and $K$ its quotient field. Let $\operatorname{Int}(D) = \{f\in K[x] \mid f(D) \subseteq D\}$ be the ring of integer-valued polynomials on $D$. Given any…

交换代数 · 数学 2019-03-29 Sophie Frisch , Sarah Nakato , Roswitha Rissner

We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…

组合数学 · 数学 2016-04-26 Peter Beelen , Sudhir R. Ghorpade , Sartaj Ul Hasan

We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum…

信息论 · 计算机科学 2010-06-22 Peter Beelen , Sudhir R. Ghorpade , Tom Hoeholdt

Rao and Zhao classified the irreducible integrable modules with finite dimensional weight spaces for the untwisted affine superalgebras which are not $\hat{A}(m,n)$ ($m\ne n$) or $\hat{C}(m)$. Here we treat the latter affine superalgebras…

表示论 · 数学 2014-04-03 Yuezhu Wu , R. B. Zhang

For a $t$-nomial $f(x) = \sum_{i = 1}^t c_i x^{a_i} \in \mathbb{F}_q[x]$, we show that the number of distinct, nonzero roots of $f$ is bounded above by $2 (q-1)^{1-\varepsilon} C^\varepsilon$, where $\varepsilon = 1/(t-1)$ and $C$ is the…

数论 · 数学 2019-02-20 Zander Kelley

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

信息论 · 计算机科学 2013-08-28 Pingzhi Yuan , Cunsheng Ding

Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power…

信息论 · 计算机科学 2016-05-12 Ziling Heng , Qin Yue

We extend coded distributed computing over finite fields to allow the number of workers to be larger than the field size. We give codes that work for fully general matrix multiplication and show that in this case we serendipitously have…

信息论 · 计算机科学 2024-10-30 Gretchen L. Matthews , Pedro Soto

In this article, we show a new general linear independence criterion related to values of $G$-functions, including the linear independence of values at algebraic points of contiguous hypergeometric functions, which is not known before. Let…

数论 · 数学 2022-03-02 Sinnou David , Noriko Hirata-Kohno , Makoto Kawashima

Let $F_q$ be the finite field with $q$ elements and $F_q[x_1,\ldots, x_n]$ the ring of polynomials in $n$ variables over $F_q$. In this paper we consider permutation polynomials and local permutation polynomials over $F_q[x_1,\ldots, x_n]$,…

组合数学 · 数学 2023-08-30 Jaime Gutierrez , Jorge Jimenez Urroz

In this paper we study generalized weights as an algebraic invariant of a code. We first describe anticodes in the Hamming and in the rank metric, proving in particular that optimal anticodes in the rank metric coincide with…

信息论 · 计算机科学 2015-10-16 Alberto Ravagnani

The Frobenius number of relatively prime positive integers $a_1, \ldots, a_n$ is the largest integer that is not a nononegative integer combination of the $a_i.$ Given positive integers $a_1, \ldots, a_n$ with $n \ge 2,$ the set of…

组合数学 · 数学 2016-11-08 Bobby Shen

Let $R$ be a commutative ring, $f \in R[X_1,\ldots,X_k]$ a multivariate polynomial, and $G$ a finite subgroup of the group of units of $R$ satisfying a certain constraint, which always holds if $R$ is a field. Then, we evaluate $\sum…

数论 · 数学 2017-05-17 Paolo Leonetti , Andrea Marino

We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…

信息论 · 计算机科学 2016-12-06 Jin Li , Aixian Zhang , Keqin Feng

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

交换代数 · 数学 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk