English
Related papers

Related papers: A new Binary Number Code and a Multiplier, based o…

200 papers

Let $f_{n}=\sum_{i=0}^n \binom{n}{i}\binom{2n-2i}{n-i}$, $g_{n}= \sum_{i=1}^n \binom{n}{i}\binom{2n-2i}{n-i}$. Let $\{a_k\}_{k=1}$ be the set of all positive integers n, in increasing order, for which $\binom{2n}{n}$ is not divisible by 5,…

Combinatorics · Mathematics 2013-02-04 Walter Shur

A Lie (super)algebra with a non-degenerate invariant symmetric bilinear form $B$ is called a nis-(super)algebra. The double extension $\mathfrak{g}$ of a nis-(super)algebra $\mathfrak{a}$ is the result of simultaneous adding to…

Representation Theory · Mathematics 2026-03-19 Sofiane Bouarroudj , Dimitry Leites , Jin Shang

An identity for binomial symbols modulo an odd positive integer $n$ relating to the least prime factor of $n$ is proved. The identity is discussed within the context of Pell conics.

Number Theory · Mathematics 2011-07-29 Samuel A. Hambleton

The harmonic numbers $H_n=\sum_{0<k\le n}1/k\ (n=0,1,2,\ldots)$ play important roles in mathematics. Let $p>3$ be a prime. With helps of some combinatorial identities, we establish the following two new congruences:…

Number Theory · Mathematics 2016-02-25 Guo-Shuai Mao , Zhi-Wei Sun

Let E be a real quadratic field with discriminant d and let p be an odd prime not dividing d. For \rho=1 or -1, we determine $\prod_{0<c<d, (d/c)=\rho} binomial coeff.{p-1}{\lfloor pc/d\rfloor}$ modulo p^2 in terms of Lucas numbers, the…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

Let $p>3$ be a prime, and let $a$ be a rational $p$-adic integer, using WZ method we establish the congruences modulo $p^3$ for $$\sum_{k=0}^{p-1} \binom ak\binom{-1-a}k\binom{2k}k\frac {w(k)}{4^k},$$ where $$w(k)=1,\frac 1{k+1},\frac…

Number Theory · Mathematics 2022-02-15 Zhi-Hong Sun

Line codes make it possible to mitigate interference, to prevent short pulses, and to generate streams of bipolar signals with no direct-current (DC) power content through balancing. They find application in magnetic recording (MR) devices,…

Information Theory · Computer Science 2020-05-26 Ahmed Hareedy , Robert Calderbank

We study the difference between the number of primitive roots modulo $p$ and modulo $p+k$ for prime pairs $p,p+k$. Assuming the Bateman-Horn conjecture, we prove the existence of strong sign biases for such pairs. More importantly, we prove…

Number Theory · Mathematics 2021-02-05 Stephan Ramon Garcia , Florian Luca , Timothy Schaaff

In this paper, we make some progress towards a well-known conjecture on the minimum weights of binary cyclic codes with two primitive nonzeros. We also determine the Walsh spectrum of $\Tr(x^d)$ over $\F_{2^{m}}$ in the case where $m=2t$,…

Information Theory · Computer Science 2015-06-12 Tao Feng , Ka Hin Leung , Qing Xiang

Let $\overline{p}_{k}(n)$ denote the number of overpartition $k$-tuples of $n$. In 2023, Saikia \cite{saikia} conjectured the following congruences: \begin{align*} \overline{p}_{q}(8n+2)& \equiv 0 \pmod{4},\quad \overline{p}_{q}(8n+3)\equiv…

Number Theory · Mathematics 2025-09-23 G. Kavya Keerthana , S. Ananya , Ranganatha D

Let $a$ and $m>0$ be integers. We show that for any integer $b$ relatively prime to $m$, the set $\{a^n+bn:\ n=1,\ldots,m^2\}$ contains a complete system of residues modulo $m$. We also pose several conjectures for further research; for…

Number Theory · Mathematics 2014-02-28 Zhi-Wei Sun

A robust Gray code, formally introduced by (Lolck and Pagh, SODA 2024), is a Gray code that additionally has the property that, given a noisy version of the encoding of an integer $j$, it is possible to reconstruct $\hat{j}$ so that $|j -…

Information Theory · Computer Science 2024-01-30 Dorsa Fathollahi , Mary Wootters

The encoding complexity of a general (en,ek) quasi-cyclic code is O[(e^2)(n-k)k]. This paper presents a novel low-complexity encoding algorithm for quasi-cyclic (QC) codes based on matrix transformation. First, a message vector is encoded…

Information Theory · Computer Science 2013-01-16 Qin Huang , Li Tang , Zulin Wang , Zixiang Xiong , Shanbao He

In this paper we obtain the [60,30,12], [64,32,12], [68,34,12], [72,36,12] self-dual codes as tailbitting convolutional codes with the smallest constraint length K=9. In this construction one information bit is modulo two added to the one…

Information Theory · Computer Science 2017-04-06 Alexander Zhdanov

A novel implementation of a special class of Galois ring, in which the multiplication can be realized by a cyclic convolution, is applied to the construction of network codes. The primitive operations involved are byte-wise shifts and…

Information Theory · Computer Science 2020-05-18 Kenneth W. Shum , Hanxu Hou

Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work.…

Information Theory · Computer Science 2012-01-10 Jiun-Hung Yu , Hans-Andrea Loeliger

A well known result of Newman says that upto a limit, multiples of $3$ with even number of 1's in binary representation always exceed multiples of $3$ with odd number of 1's. The phenomenon of preponderance of even number of 1's is now…

Number Theory · Mathematics 2015-11-11 Sai Teja Somu

A binary linear code whose permutation automorphism group has a fixed point free permutation of order $3$ is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let $C$ be a…

Information Theory · Computer Science 2026-01-07 Murat Altunbulak , Fatma Altunbulak Aksu , Roghayeh Hafezieh , İpek Tuvay

This paper examines with elementary proofs some interesting properties of numbers in the binary quadratic form $a^2+ab+b^2$, where $a$ and $b$ are non-negative integers. Key findings of this paper are (i) a prime number $p$ can be…

Number Theory · Mathematics 2007-05-23 Umesh P. Nair

In this paper, we propose a compositional nonparametric method in which a model is expressed as a labeled binary tree of $2k+1$ nodes, where each node is either a summation, a multiplication, or the application of one of the $q$ basis…

Machine Learning · Statistics 2019-05-28 Yixi Xu , Jean Honorio , Xiao Wang
‹ Prev 1 4 5 6 7 8 10 Next ›