If C is a q-ary code of length n and a and b are two codewords, then c is called a descendant of a and b if c i # [a i , b i ] for i=1, ..., n. We are interested in codes C with the property that, given any descendant c, one can always identify at least one of the ``parent'' codewords in C. We study
β¦ LIBER β¦
On codes withw-identifiable parent property
β Scribed by Jun Ma; Yu Xiong
- Book ID
- 107622571
- Publisher
- Chinese Electronic Periodical Services
- Year
- 2008
- Tongue
- English
- Weight
- 308 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1007-1172
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On Codes with the Identifiable Parent Pr
β
Henk D.L Hollmann; Jack H van Lint; Jean-Paul Linnartz; Ludo M.G.M Tolhuizen
π
Article
π
1998
π
Elsevier Science
π
English
β 217 KB
Prolific Codes with the Identifiable Par
β
Blackburn, Simon R.; Etzion, Tuvi; Ng, Siaw-Lynn
π
Article
π
2008
π
Society for Industrial and Applied Mathematics
π
English
β 220 KB
On the Maximal Codes of Length 3 with th
β
TΓ΄, Vu Dong; Safavi-Naini, Reihaneh
π
Article
π
2004
π
Society for Industrial and Applied Mathematics
π
English
β 300 KB
Parent-Identifying Codes
β
Noga Alon; Eldar Fischer; Mario Szegedy
π
Article
π
2001
π
Elsevier Science
π
English
β 112 KB
For a set C of words of length 4 over an alphabet of size n, and for a, b # C, let D(a, b) be the set of all descendants of a and b, that is, all words x of length 4 where x i # [a i , b i ] for all 1 i 4. The code C satisfies the Identifiable Parent Property if for any descendant of two code-words
Generalized hashing and parent-identifyi
β
Noga Alon; GΓ©rard Cohen; Michael Krivelevich; Simon Litsyn
π
Article
π
2003
π
Elsevier Science
π
English
β 147 KB
A note about the identifier parent prope
β
Marcel Fernandez; Josep Cotrina; Miguel Soriano; Neus Domingo
π
Article
π
2010
π
Elsevier Science
π
English
β 211 KB