The Setting
The comparison concerns individual Gaussian weights at Boolean translates of a code-lattice point and a sparse maximum along a line in the residue grid.
Let be a finite coordinate set of cardinality , and let be a prime. Write for the coordinatewise reduction of modulo , and for the least nonnegative representatives of . For , the grid anchor , floor vector and grid residue are the maps in (1). (1) The grid cell is the half-open box in (2); the scaled integer vector and the Construction A lattice of a linear code are given there as well. (2)
Folded Gaussian Weights
The standard Gaussian densities on and are (3). (3) For , the univariate folded density and the product folded density are defined by (4). (4) A Boolean digit has numerical value zero for false and one for true; a Boolean word uses these values coordinatewise.✦ The conditional bit probability , conditional word probability and Gaussian atom are the functions in (5), with . (5)
For a finite field , a finite -vector space , a subset and functions , the sparse normalized weight and the line maximum in direction are given by (6). (6) For and , the sparse Gaussian line weight and its code lattice are defined by (7). (7)
Blocks and Eligibility
A folded Gaussian block consists of a natural dimension , a prime modulus , a positive height , a usable residue set and a nonzero direction .✦ Its block group is ✦, and its real vector space is .✦ For , the block density , lattice , grid residue and Gaussian weight are given by (8); the Boolean vertex translate is defined there for every . (8)
For positive block dimensions , the Gaussian height is the prescribed scale in (9). The folded mass is the integral of on the unit interval✦, and the mean log density is its normalized density-weighted logarithmic mean, also given in (9)✦; all logarithms are natural. (9) For a nonzero modulus , the eligible grid residue set is the finite residue set selected at height , reference mean , deviation parameter and threshold . The eligible block residues are its specialization in (10). (10)✦
The Claim
Theorem 1. Let be finite, prime, , and , and abbreviate . Suppose that satisfies . There exist and satisfying the Gaussian cell bound (11) for every and : (11)✦ For a folded Gaussian block and with , there exist and satisfying the block cell bound (12) for every and : (12)✦ There is a constant with the following property for all sufficiently large . Suppose that is prime and , and let and . The eligible atom bounds (13) hold for every : (13)✦
In the paper, the result reads: for its modulus , code , usable set , line maximum and error parameter , let , , and ; if , choose a maximizing with in standard representatives, so that , and , and every Boolean word satisfies , at each coordinate and , with this individual weight at most .
What Is Checked
The cell statements (11) and (12) concern finite coordinate spaces, prime moduli and positive heights with arbitrary usable residue sets; the block direction is nonzero. The eligible atom statement (13) concerns the prescribed height and eligible sets under the stated lower bound on the modulus. The Construction A set in (2) is an additive subgroup of and is closed under multiplication by integers.