%0 Journal Article
%T (r,k)-catching code<br>
%J 科学通报(英文版)
%D 1998
%I 
%X A collection of r_words on an alphabet of n letters is called (r,k)_catching code if for every r_word w there is one selected member v such that v coincides with w in at least k places. How large is the smallest size of the (r,k)_catching code and how to find the minimal (r,k)_\%catching code? Some methods are advanced to construct such codes.
%K catching code<br>
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=96E6E851B5104576C2DD9FC1FBCB69EF&jid=DD6615BC9D2CFCE0B6F945E8D5314523&aid=C05EEDF95F5E608181F5C54C157A1FA6&yid=8CAA3A429E3EA654&vid=BE33CC7147FEFCA4&iid=F3090AE9B60B7ED1&sid=525CF7714FCB18E2&eid=525CF7714FCB18E2&journal_id=1001-6538&journal_name=科学通报(英文版)&referenced_num=0&reference_num=0