381 search results - page 77 / 77 » Error-Correcting Codes in Steganography |
ECCC
1998
13 years 6 months ago
1998
The Chinese Remainder Theorem states that a positive integer m is uniquely speci ed by its remainder modulo k relatively prime integers p1;:::;pk, provided m < Qk i=1 pi. Thus ...