Abstract
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 \leq 2.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have