We consider codes  for multiple-access channels with intensity information (channel B) and limited usage, i.e., signature codes. We derive upper and lower bounds for such codes and show how these results can be applied for constructing collusion-secure  multimedia fingerprinting codes in  presence of noise. We prove that best such codes have nonvanishing rate and can trace the entire coalition of  pirates and do it either with zero error probability or w.h.p. depending on the corresponding model of errors.