Minimum Pearson Distance Detection Using Mass-Centered Codewords in the Presence of Unknown Varying Offset

We consider the transmission and storage of data that use coded binary symbols over a channel, where a Pearson distance-based detector is used for achieving resilience against additive noise, unknown channel gain, and varying offset. We study minimum Pearson distance (MPD) detection in conjunction with a set, S, of codewords satisfying a center-of-mass constraint. We investigate the properties of the codewords in S, compute the size of S, and derive its redundancy for asymptotically large values of the codeword length n. The redundancy of S is approximately (3/2) log₂ n + α, where α = log₂(π/24)^1/2 = -1.467.. for n odd and α = -0.467.. for n even. We describe a simple encoding algorithm whose redundancy equals 2 log₂ n+ o(logn). We also compute the word error rate of the MPD detector when the channel is corrupted with additive Gaussian noise.