A Uniquely Decodable (UD) Code is a code such that any vector of the ambien
t space has a unique closest codeword. In this paper we begin a study of th
e structure of UD codes and identify perfect subcodes. In particular we det
ermine all linear UD codes of covering radius less than or equal to 2.