Abstract | ||
---|---|---|
AUniquely Decodable (UD) Code is a code such that any vector ofthe ambient space has a unique closest codeword. In this paperwe begin a study of the structure of UD codes and identify perfectsubcodes. In particular we determine all linear UD codes of coveringradius \leq 2. |
Year | DOI | Venue |
---|---|---|
1999 | 10.1023/A:1008306605740 | Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus |
Keywords | Field | DocType |
perfect code,dominating set,design | Ambient space,Discrete mathematics,Locally decodable code,Combinatorics,Covering code,Linear code,Reed–Muller code,Code word,Code (cryptography),Prefix code,Mathematics | Journal |
Volume | Issue | ISSN |
17 | 1-3 | 1573-7586 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Gérard Cohen | 1 | 877 | 176.34 |
J. Rifà | 2 | 52 | 9.95 |
J. Tena | 3 | 15 | 2.99 |
G. Zemor | 4 | 232 | 16.71 |