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
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