Polynomials over primary residue rings with a small unique distance

We consider polynomials over small residue rings. For polynomials with the unique distance equaled to twice the degree of the polynomial, we show how to use them for constructing cryptographic primitives.