achowe@watmsg.waterloo.edu (CrackerJack) (04/07/88)
[...stuff deleted...] >On the other hand, the UUencode program does an encoding that takes >each set of three octets (24 bits) and produces 4 printable characters, >by a rule that uses each set of 6 bits to index into a vector string >with 64 elements. You can see what these are by looking at a UUencoded >file. The result is a file 4/3 the size of the original. The inverse >function is UUdecode. Most folks that have UUencode-UUdecode are not >interested in BinHex. Probably the best functions of this type are >UUE and UUD done by J-P Dumas. For the curious at heart, what is the mapping function used by UUENCOD? -- achowe@watmsg.waterloo.edu |"A Cray is so fast it can finish an __ _ | infinite loop in 3 minutes." / _ _ _ |/ _ _ | _ _ |/ | - P.A.Buhr \__| `<_\<_ |\|= | ` \_/<_\<_ |\ | disclaimer...