作者:
Charon， I.， Cohen， G.， et al.
关键词:
genetic algorithms；simulated annealing；spatial sampling；ozone network design
摘要:
Let be the binary -cube, or binary Hamming space of dimension , endowed with the Hamming distance. For and , we denote by the ball of radius and centre . A set is said to be an -identifying code if the sets , , are all nonempty and distinct. We give new constructive upper bounds for the minimum cardinalities of -identifying codes in the Hamming space.
在线下载