Related papers: Integer Addition and Hamming Weight

We first introduce the Hamming distance between two strings. Then, we apply this concept to the representations of whole numbers in base n for all positive integers n > 2. We claim that a simple formula exists for the sum of all Hamming…

We revisit inflation coupled with vector fields employing kinetic coupling in the comoving gauge. It is known that there is a cumulative effect $IN^2$ on the curvature power spectrum. For a large number of e-foldings $N$, this contribution…

Consider the weight $\lambda$ which is the sum of all simple roots of a simple Lie algebra. Using Kostant's weight multiplicity formula we describe and enumerate the contributing terms to the multiplicity of the zero weight in the…

The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…

An interferometric arrangement is proposed in which the technique of weak value amplification is implemented in order to enlarge the effect of a single photon on the quadratures of a movable mirror of an optical cavity. The photon interacts…

Let $\alpha$ be a complex number. We show that there is a finite subset $F$ of the ring of the rational integers $\mathbb{Z}$, such that $F\left[ \alpha\right] =\mathbb{Z}\left[ \alpha\right]$, if and only if $\alpha$ is an algebraic number…

Recent results from the Atacama Cosmology Telescope (ACT), when combined with Planck and DESI datasets, indicate a scalar spectral index $n_s$ larger than that reported in the Planck 2018 baseline, thereby challenging conventional…

Binary addition is one of the most primitive and most commonly used applications in computer arithmetic. A large variety of algorithms and implementations have been proposed for binary addition. Huey Ling proposed a simpler form of CLA…

The first part of this paper is devoted to the study of the orthogonal polynomial on the circle, with respect of a weight of type $f_\alpha (\theta) = (2\cos \theta- 2\cos \theta_0)^{2\alpha} c_1$ with $\theta_0 \in ]0,\pi[$, -1/2…

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…

Integer partitions express the different ways that a positive integer may be written as a sum of positive integers. Here we explore the analytic properties of a new polynomial $f_\lambda(x)$ that we call the partition polynomial for the…

Integer and fractional quantum Hall effects were studied with different physics models and explained by different physical mechanisms. In this paper, the common physical mechanism for integer and fractional quantum Hall effects is studied,…

For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of finding representations with minimal weight has been solved…

We give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of…

Working in the multitape Turing model, we show how to reduce the problem of matrix transposition to the problem of integer multiplication. If transposing an $n \times n$ binary matrix requires $\Omega(n^2 \log n)$ steps on a Turing machine,…

Let $f$ be a real polynomial with irrational leading co-efficient. In this article, we derive distribution of $f(n)$ modulo one for all $n$ with at least three divisors and also we study distribution of $f(n)$ for all square-free $n$ with…

We consider the question of determining the higher weights or the generalized Hamming weights of affine Grassmann codes and their duals. Several initial as well as terminal higher weights of affine Grassmann codes of an arbitrary level are…

We investigate integers whose base $g$ expansion omits a fixed digit and which can be represented as a sum of two prime squares. In the first part of the paper, we apply the Hardy--Littlewood circle method to obtain asymptotic formulas for…

We define generalized Hamming weights for almost affine codes. We show how various aspects and applications of generalized Hamming weights for linear codes, such as Wei duality, generalized Kung's bound, profiles, connection to wire-tap…

A mapping of $k$-bit strings into $n$-bit strings is called an $(\alpha,\beta)$-map if $k$-bit strings which are more than $\alpha k$ apart are mapped to $n$-bit strings that are more than $\beta n$ apart. This is a relaxation of the…