论文信息 - The Mastermind game and the rigidity of the Hamming space

The Mastermind game and the rigidity of the Hamming space

A new approach to investigating the Mastermind game and related problems, among them uniquely decodable codes for noiseless adder channel, based on ideas and methods of coding theory is proposed. This approach leads to improved bounds in various problems associated with the rigidity of Hamming spaces.

[1] David G. Cantor. Determining a set from the cardinalities of its intersections with other sets , 1964 .

[2] Zoltán Füredi,et al. An Improved Upper Bound of the Rate of Euclidean Superimposed Codes , 1999, IEEE Trans. Inf. Theory.

[3] E. J. Weldon,et al. Coding for T-user multiple-access channels , 1979, IEEE Trans. Inf. Theory.