On codes with the identifiable parent property (Q1268617): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q106166318, #quickstatements; #temporary_batch_1714632961156
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jean-Paul M. G. Linnartz / rank
Normal rank
 
Property / author
 
Property / author: L. M. G. M. Tolhuizen / rank
Normal rank
 
Property / author
 
Property / author: Jean-Paul M. G. Linnartz / rank
 
Normal rank
Property / author
 
Property / author: L. M. G. M. Tolhuizen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcta.1997.2851 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970997983 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q106166318 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 08:56, 2 May 2024

scientific article
Language Label Description Also known as
English
On codes with the identifiable parent property
scientific article

    Statements

    On codes with the identifiable parent property (English)
    0 references
    0 references
    0 references
    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
    0 references
    identification cardinality
    0 references
    code
    0 references
    codewords
    0 references
    0 references
    0 references