On codes with the identifiable parent property (Q1268617)
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 1212922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On codes with the identifiable parent property |
scientific article; zbMATH DE number 1212922 |
Statements
On codes with the identifiable parent property (English)
0 references
12 April 1999
0 references
Suppose \(C\) is a code of length \(n\) over an alphabet \(Q\) containing \(q\) elements and let \(a\) and \(b\) be any two codewords. Then \(c\) is a decendent of \(a\) and \(b\) if \(c_i\) is in \((a_i,b_i)\), for \(i= 1,2,\dots, n\). The authors are interested in codes \(C\) such that given any decendent \(c\), one of the ``parent'' codewords in \(C\) can always be identified. Various bounds on the maximal cardinality of a code \(C\) with the foregoing property are determined.
0 references
identification cardinality
0 references
code
0 references
codewords
0 references
0.9046207070350648
0 references
0.888538122177124
0 references
0.8880293369293213
0 references
