Related papers: On the Number of Inequivalent Binary Self-Orthogon…
We consider multiple orthogonal polynomials with respect to Nikishin systems generated by two measures $(\sigma_1, \sigma_2)$ with unbounded supports ($\mbox{supp} \, \sigma_1 \subseteq \mathbb{R}_+$, $\mbox{supp} \, \sigma_2 \subseteq…
Let $R$ be a commutative ring with identity. The paper studies the problem of self-orthogonality and self-duality matrix-product codes (MPCs) over $R$. Some methods as well as special matrices are introduced for the construction of such…
Let $pod_2(n)$ denote the number of $2$-regular partitions of $n$ with distinct odd parts (even parts are unrestricted). In this article, we obtain congruences for $pod_2(n)$ mod $2$ and mod $8$ using some generating function manipulations…
This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed…
For a system of two measures supported on a starlike set in the complex plane, we study asymptotic properties of associated multiple orthogonal polynomials $Q_{n}$ and their recurrence coefficients. These measures are assumed to form a…
There is a local ring $E$ of order $4,$ without identity for the multiplication, defined by generators and relations as $E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b\rangle.$ We study a special construction of self-orthogonal…
Two algorithms for computing $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, are described, and using a combination of these two algorithms, the resulting algorithm is $O(n^{3/2})$. The second algorithm uses a list…
In this short communication we introduce a rather simple autonomous system of 2 nonlinearly-coupled first-order Ordinary Differential Equations (ODEs), whose initial-values problem is explicitly solvable by algebraic operations. Its ODEs…
We study the structure of the algebra of polynomial invariants for the usual conjugation action of the complex special, SO_n, and general, O_n, orthogonal group on the space of traceless n by n complex matrices. (Note that these two…
Consider $\{p_n\}_{n=0}^{\infty}$, a sequence of polynomials orthogonal with respect to $w(x)>0$ on $(a,b)$, and polynomials $\{g_{n,k}\}_{n=0}^{\infty},k \in \mathbb{N}_0$, orthogonal with respect to $c_k(x)w(x)>0$ on $(a,b)$, where…
In this paper, we consider the problem of constructing optimal average-length binary codes under the constraint that each codeword must contain at most $D$ ones, where $D$ is a given input parameter. We provide an $O(n^2D)$-time complexity…
In this paper, we exhibit explicitly a sequence of $2\times2$ matrix valued orthogonal polynomials with respect to a weight $W_{p,n}$, for any pair of real numbers $p$ and $n$ such that $0<p<n$. The entries of these polynomiales are…
We examine and compare several different classes of "balanced" block codes over q-ary alphabets, namely symbol-balanced (SB) codes, charge-balanced (CB) codes, and polarity-balanced (PB) codes. Known results on the maximum size and…
In this paper, we are concerned about optimal two-dimensional optical orthogonal codes with $\lambda$ = 2. Some combinatorial constructions are presented and many infinite families of optimal two-dimensional optical orthogonal codes with…
We study two families of orthogonal polynomials. The first is a finite family related to the Askey-Wilson polynomials but the orthogonality is on the real line. A limiting case of this family is an infinite system of orthogonal polynomials…
For a prime $p$ and an integer $a \in \Z$ we obtain nontrivial upper bounds on the number of solutions to the congruence $x^x \equiv a \pmod p$, $1 \le x \le p-1$. We use these estimates to estimate the number of solutions to the congruence…
It is known that orthogonal polynomials obey a 3 terms recursion relation, as well as a 2x2 differential system. Here, we give an explicit and concise expression of the differential system in terms of the recursion coefficients. This result…
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n = 9 to n = 12. These codes have a well-known interpretation…
In this paper, we give a construction of doubly even self-orthogonal codes from quasi-symmetric designs. Further, we study orbit matrices of quasi-symmetric designs and give a construction of doubly even self-orthogonal codes from orbit…
We present a generalization of the tilted Bell inequality for quantum [[n,k,d]] error-correcting codes and explicitly utilize the simplest perfect code, the [[5,1,3]] code, the Steane [[7,1,3]] code, and Shor's [[9,1,3]] code, to…