On the characterization of linear uniquely decodable codes
A Uniquely Decodable (UD) Code is a code such that any vector of the ambient space has a unique closest codeword. In this paper we begin a study of the structure of UD codes and identify perfect subcodes. In particular we determine all linear UD codes of covering radius less than or equal to 2.
perfect code dominating set design