Path: utzoo!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!mailrus!ncar!ames!elroy!gryphon!vector!telecom-request From: robert@eva.slu.se (Robert Olsson datoravd, EMC tfn 018-172581) Newsgroups: comp.dcom.telecom Subject: image compressing in facsimile machines - algorithm wanted Message-ID: Date: 26 Aug 88 20:40:47 GMT Sender: chip@vector.UUCP Organization: SLU, Swedish university of agricultural sciences Lines: 12 Approved: telecom-request@vector.uucp (USENET Telecom Moderator) X-TELECOM-Digest: volume 8, issue 136, message 2 X-Submissions-To: telecom@xx.lcs.mit.edu (Mailing List Coordinator) X-Administrivia-To: telecom-request@vector.uucp (USENET Telecom Moderator) [ This message was cross-posted to comp.lang.c and comp.dcom.modems. ] [ I am placing it only in comp.dcom.telecom. -chip ] Has anybody made an implementation of the codes in the CCITT T.4 telefax recommendation. I think it's called modified Huffman code and is used to compress scanned images in facsimile machines. I've stared at codes for some time now and may be capable of encoding from run lengths to Huffman codes - but decoding Huffman codes into run lengths ? To do that I would definitely need the algorithm. Where can I find it ? Or code? Robert Olsson Swedish university of agricultural sciences