Loading...
Please wait, while we are loading the content...
On the Characterization of Linear Uniquely Decodable Codes (1998)
| Content Provider | CiteSeerX |
|---|---|
| Author | Zémor, G. Tena, J. Rif, J. Cohen, G. |
| Abstract | A Uniquely Decodable (UD) Code is a code such that any vector of the ambiant 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. |
| File Format | |
| Publisher Date | 1998-01-01 |
| Access Restriction | Open |
| Subject Keyword | Unique Closest Codeword Linear Ud Code Linear Uniquely Decodable Code Ud Code Uniquely Decodable Ambiant Space Perfect Subcodes |
| Content Type | Text |
| Resource Type | Article |