On the characterization of linear uniquely decodable codes (Q1963167)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the characterization of linear uniquely decodable codes |
scientific article; zbMATH DE number 1392726
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the characterization of linear uniquely decodable codes |
scientific article; zbMATH DE number 1392726 |
Statements
On the characterization of linear uniquely decodable codes (English)
0 references
24 January 2000
0 references
A uniquely decodable (UD) code is a code such that any vector of the ambient space has a unique closest codeword. After the introduction, in Section 2, the authors investigate the structure of general binary linear UD code and identify perfect subcodes. In Section 3 these results are applied to solve the existence problem for UD codes in the case when the covering radius \(\rho\leq 2\). Finally, nonlinear and nonbinary versions of Section 2 are envisaged.
0 references
linear uniquely decodable codes
0 references
existence
0 references
covering radius
0 references
0.9125153
0 references
0 references
0 references
0 references
0 references
