排序方式: 共有3条查询结果,搜索用时 15 毫秒
1
1.
Ranto S.M. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2003,49(6):1544-1547
Identifying codes can be used to locate malfunctioning processors. We say that a code C of length n is a linear (1,/spl les/l)-identifying code if it is a subspace of F/sub 2//sup n/ and for all X,Y/spl sube/F/sub 2//sup n/ such that |X|, |Y|/spl les/l and X/spl ne/Y, we have /spl cup//sub x/spl isin/X/(B(x)/spl cap/C)/spl ne//spl cup/y/spl isin/Y(B(y)/spl cap/C). Strongly (1,/spl les/l)-identifying codes are a variant of identifying codes. We determine the cardinalities of optimal linear (1,/spl les/l)-identifying and strongly (1,/spl les/l)-identifying codes in Hamming spaces of any dimension for locating any at most l malfunctioning processors. 相似文献
2.
Ranto K. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2000,46(6):2193-2197
The Z4-linear Goethals-like code of length 2m has 22m+1-3m-2 codewords and minimum Lee distance 8 for any odd integer m⩾3. We present an algebraic decoding algorithm for all Z4-linear Goethals-like codes Ck introduced by Helleseth et al.(1995, 1996). We use Dickson polynomials and their properties to solve the syndrome equations 相似文献
3.
Ranto S.M. Honkala I.S. Laihonen T.K. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2002,48(5):1200-1203
A motivation for identifying codes comes from quality control in multiprocessor systems, that is, we are able, with the aid of these codes, to find faulty processors in such a system. We give a construction of two infinite families of optimal codes, which identify up to two malfunctioning processors in Hamming spaces 相似文献
1