is simplified. Upper bounds on the coding type problem, i.e. the determination of the maximum cardinality of a code consisting of unordered pairs of subsets far away from each other, are improved. The sphere packing problem, i.e. the determination of the maximum number of disjoint balls of a prescribed radius, is introduced and discussed. It is less closely connected to the first problem than it is in the most important spaces of coding theory.
Agrell, E., Vardy, A. and Zeger, K.
, Upper Bounds for Constant-Weight Codes,
IEEE Trans. Inform. Theory
Zeger K., 'Upper Bounds for Constant-Weight Codes' (2008) 46IEEE Trans. Inform. Theory: 2373-2395.
Zeger K.Upper Bounds for Constant-Weight CodesIEEE Trans. Inform. Theory20084623732395)| false