Related papers: Ordering of nested square roots of 2 according to …
In this paper we consider self-dual NRT-codes, that is, self-dual codes in the metric space endowed with the Niederreiter-Rosenbloom-Tsfasman (NRT-metric). We use polynomial invariant theory to describe the shape enumerator of a binary…
For odd square-free n > 1 the n-th cyclotomic polynomial satisfies an identity of Gauss. There are similar identity of Aurifeuille, Le Lasseur and Lucas. These identities all involve certain polynomials with integer coefficients. We show…
It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…
In this article we use a method of finding the index of a complex-valued function by determined number of arithmetic operations to describe an algorithm of localization of roots of square-free polynomials. We give an estimation of the…
We generalize a theorem of Littlewood concerning the factorization of Schur polynomials when their variables are twisted by roots of unity. We show that a certain family of flagged skew Schur polynomials admit a similar factorization. These…
We describe the limit zero distributions of sequences of polynomials with positive coefficients.
Understanding the distribution of digits in the expansions of perfect powers in different bases is difficult. Rather than consider the asymptotic digit distributions, we consider the base-10 digits of a restricted sequence of powers of two.…
Given an integer base $b\geq 2$, a number $\rho\geq 1$ of colors, and a finite sequence $\Lambda=(\lambda_1,\ldots,\lambda_\rho)$ of positive integers, we introduce the concept of a $\Lambda$-restricted $\rho$-colored $b$-ary partition of…
In this paper, we construct an infinite family of five-weight codes from trace codes over the ring $R=\mathbb{F}_2+u\mathbb{F}_2$, where $u^2=0.$ The trace codes have the algebraic structure of abelian codes. Their Lee weight is computed by…
We study a family of polynomials whose values express degrees of Schubert varieties in the generalized complex flag manifold G/B. The polynomials are given by weighted sums over saturated chains in the Bruhat order. We derive several…
We give asymptotic approximations of the zeros of certain high degree polynomials. The zeros can be used to compute the filter coefficients in the dilation equations which define the compactly supported orthogonal Daubechies wavelets.…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…
Let $ \{L_n\}_{n\geq 0} $ be the sequence of Lucas numbers. In this paper, we determine all Lucas numbers that are palindromic concatenations of two distinct repdigits.
In this paper, we examine the linear codes with respect to the Hamming metric from incidence matrices of the zero-divisor graphs with vertex set is the set of all non-zero zero-divisors of the ring $\mathbb{Z}_n$ and two distinct vertices…
The zeros of D'Arcais polynomials, also known as Nekrasov--Okounkov polynomials, dictate the vanishing of the Fourier coefficients of powers of the Dedekind functions. These polynomials satisfy difference equations of hereditary type with…
For each r, 0 <= r <= m, it is presented the class of quaternary linear codes LRM(r,m) whose images under the Gray map are binary codes with parameters of Reed-Muller RM(r,m) code of order r.
A binary partition of a positive integer $n$ is a partition of $n$ in which each part has size a power of two. In this note we first construct a Gray sequence on the set of binary partitions of $n$. This is an ordering of the set of binary…
The sum-product algorithm for decoding of binary codes is analyzed for bipartite graphs in which the check nodes all have degree $2$. The algorithm simplifies dramatically and may be expressed using linear algebra. Exact results about the…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
In this note, we study the divisibility relation $U_m\mid U_{n+k}^s-U_n^s$, where ${\bf U}:=\{U_n\}_{n\ge 0}$ is the Lucas sequence of characteristic polynomial $x^2-ax\pm 1$ and $k,m,n,s$ are positive integers.