We discuss the application of coding constructs to the problem of radio transmission scheduling in ad hoc wireless networks. We are particularly interested in the ability to scale such ad hoc wireless networks to thousands of nodes. Current media access protocols do not scale well to larger networks than a few dozen nodes.

We examine the possible ways to apply superimposed codes and almost disjunct codes to these networks media access layer. We analyzed how well one can build codes that are not as powerful as superimposed codes but have better parameters for the case of ad hoc networks. We look at the local network performance that a particular node can expect using these codes. We also examine the system wide performance using an approximate simulation of thousands of ad hoc wireless nodes.