The Setting
A periodic defect replaces an ordinary binary primitive by . Conditioning on the number of retained primitive slots gives a rank experiment: specified defect slots must occupy specified positions in the retained sequence. Slots, observed ranks, and primitive block positions are numbered from zero.
Let be the requested deletion probability, so that each bit survives with probability . The working deletion rate and its associated scale are the quantities specified in (1); the construction theorems call this working rate . (1)
The ordinary run , for , is the binary word consisting of consecutive ordinary primitives, as in (2). (2)✦
Write . A finite probability law on a finite set is a function with nonnegative values and .✦ For , a fixed-size subset of is a subset with exactly elements.✦ The uniform subset law assigns the mass in (3) to each such subset. (3)✦
For a fixed-size subset , the slot at observed rank , denoted , is its th element in increasing order.✦ An increasing tuple in is a tuple with strictly increasing coordinates.✦ For tags and ranks , the tagged rank event is the set of subsets specified in (4). (4)✦
The lower and upper bounds and of the th open tuple gap are the slot boundaries in (5); its size is . For a rank tuple, the same definitions use ambient size . (5)
The binomial mass , for and , is the function in (6), with when . (6)✦
Positional Differences
A safe tagged tuple is a tuple of interior tags separated by at least three slots, with the precise conditions in (7). A positional difference order specifies the unchanged, first, or second difference, respectively.✦ The positional difference coefficients , for , are given in (8). (8)✦ For a safe tagged tuple and a displacement choice , the displaced tag tuple is defined by (9).
The Claim
Definition 1 (Periodic defects and rank differences). For , the single defect period is the binary word in (10). (10)✦ For , tags , and ranks , the conditional rank kernel is the probability in (11). (11)✦ If and are strictly increasing and , this kernel has the binomial product representation (12). (12)✦ For a safe tagged tuple , positional orders , and an increasing rank tuple , the positional rank difference is defined by (13). (13)✦
In the paper, with ambient size parameter and periods, the result reads: , , , and , with the remaining side count filling the word to length in ; a period has primitive blocks with replacing at position , where ; independently at each primitive, a common empty-output mass is silently erased, and otherwise a mark in is returned, with the returned empty mark distinct from silence; conditional on returned marks among slots, the retained subset is uniform, for an increasing tuple of defect periods, is the probability that their defect slots occur at specified increasing ranks, and sums over increasing -tuples of defect periods; a count is admissible when ; coarse gaps have half-integer endpoints and integer internal gaps; with low-degree cutoff , the operators and use the shift moving the th tag one slot, and .
What Is Checked
The definitions are stated over finite binary words, fixed-size subsets with , and tagged slot and rank tuples, with interior separation imposed for positional differences.
For , the binomial coefficient is positive, and the uniform subset law has nonnegative masses summing to one.