On codes with the identi able parent property


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 ci 2 fai; big 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 bounds on F (n; q), the maximal cardinality of a code C with… (More)


Cite this paper

@inproceedings{Hollmann1997OnCW, title={On codes with the identi able parent property}, author={Henk D. L. Hollmann and J. H. van Lint and Jean-Paul M. G. Linnartz}, year={1997} }