On the Characterization of Linear Uniquely Decodable Codes |
| |
| Authors: | G. Cohen J. Rifà J. Tena G. Zémor |
| |
| Affiliation: | (1) ENST, Dept Inf. and Res., Paris, France;(2) Computer Science Department at the Autonomous, University of Barcelona, Spain;(3) Algebra and Geometry Department at the, University of Valladolid, Spain |
| |
| 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  2. |
| |
| Keywords: | perfect code dominating set design |
| 本文献已被 SpringerLink 等数据库收录！ |
