The required transmission time decreases as the data rate increases on a single link. When broad-casting in an ad hoc radio network, this may not be so, as the number of retransmissions may grow as the data rate increases because of decreased transmission range. Moreover, there is often a non-trivial optimum. To resolve the problem of selecting an appropriate rate in such a network, the authors propose a novel method that is theoretically optimal under certain simplifying conditions. When compared with other rate selection methods under more realistic assumptions, the authors have found it to perform better. It is also easy to implement in a real system.

The paper "New Results on Frame-Proof Codes and Traceability Schemes" claims to give results for two code classes, frame-proof codes and traceability schemes, in the form of lower bounds on the maximum code size, and explicit code constructions. We will here briefly review the four claims of, noting that the proofs and constructions presented in fail, and that the claims also contradict previously published upper bounds.

Traceability codes are identifiable parent property (IPP) codes with the additional requirement that the Hamming distance can be used to trace a parent of a word. Traceability codes can be used for constructing digital fingerprints in order to deter users from illegally copying digital data. We construct a class of traceability codes and determine the exact parameters of some of the codes in this class.