Trellis source codes based on linear congruential recursions

We evaluate a new class of rate-distortion codes based on simple linear congruential recursions. Codes are demonstrated for the memoryless uniform, Gaussian, Laplacian and gamma sources, whose performance often exceeds that so far reported in the literature, including that for TCQ codes. At a source coding rate of one bit per sample, the performance at 512 states is 0.24 dB from the Shannon limit for the memoryless Gaussian source.