home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!mcsun!sun4nl!alchemy!accucx!nevries
- From: nevries@accucx.cc.ruu.nl (Nico E de Vries)
- Newsgroups: comp.compression
- Subject: Re: Request: Arithmetic coding for binary alphabets
- Message-ID: <3051@accucx.cc.ruu.nl>
- Date: 9 Sep 92 13:20:34 GMT
- References: <c5Uy031J7clG00@amdahl.uts.amdahl.com>
- Organization: Academic Computer Centre Utrecht
- Lines: 28
-
- In <c5Uy031J7clG00@amdahl.uts.amdahl.com> fadden@uts.amdahl.com (Andy McFadden) writes:
-
- >Bell/Cleary/Witten briefly describe a form of arithmetic coding which
- >works for binary alphabets (i.e. it interprets the input bit stream as, well,
- >a stream of bits). I'm looking for source code for this.
-
- In principle any arithmetic coder can be used. Just use a single bit
- alphabet. The comp.compression FAQ contains location of sources.
-
- It is however likely you are refering to higher order arithmetic compression
- since basic arithemetic coding is not likely to do well with a single bit
- alphabet. You would make a chance on compressing much 0's with now and
- than a 1 (e.g. FAX compression) but there are other schemes which do better
- in thise case (e.g. FAX compression).
-
- I believe one of the contestants of the DR Dobbs compression contest
- used single bit higher order compression but I am not sure. See
- comp.compression FAQ for availability of the sources of this contest.
-
- >fadden@uts.amdahl.com (Andy McFadden)
-
-
- Nico E. de Vries
- _ _
- O O USENET nevries@cc.ruu.nl FIDO 2:281/708.1 COMPUSERVE ^%#$*%^
- o This text reflects MY opinions, not that of my employer BITECH.
- \_/ This text is supplied 'AS IS', no waranties of any kind apply.
- Don't waste your time on complaining about my hopeless typostyle.
-