No label defined (Q4500987)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1498796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1498796 |
Statements
3 September 2000
0 references
uniquely decodable code
0 references
perfect subcodes
0 references
covering radius
0 references
0.99999994
0 references
0.9125153
0 references
0 references
0 references
0 references
0 references
A subset \(C\) of \(F^n\) is a uniquely decodable (UD) code if, for every \(v\in F^n\), there exists a unique \(c\in C\) such that \(d(v,C)=d(v,c)\). The structure of UD codes is studied. All linear UD codes of covering radius not more than 2 are determined. It is proven that a linear UD code with covering radius 2 is either the trivial \([5,1,5]\) repetition code or the product of two Hamming codes. Special perfect subcodes of a linear UD code are considered. For the entire collection see [Zbl 0918.00043].
0 references
