X-Git-Url: https://git.gag.com/?a=blobdiff_plain;f=TODO;h=604ea4993e2e9658afaba268dc2b2cdc980eb7da;hb=d49274f4ed038cfb361d634dc78143759ffc7a0d;hp=268777f801d94444f11a73022d7462fbb7d87dd8;hpb=fba1018bd31a329096155da48b75f8c9bcdbbd67;p=debian%2Fgzip

diff --git a/TODO b/TODO
index 268777f..604ea49 100644
--- a/TODO
+++ b/TODO
@@ -31,16 +31,14 @@ Some of the planned features include:
   should be done in chunks to reduce memory usage.)
 
 - Add a super-fast compression method, suitable for implementing
-  file systems with transparent compression. One problem is that the
-  best candidate (lzrw1) is patented twice (Waterworth 4,701,745
-  and Gibson & Graybill 5,049,881). The lzrw series of algorithms
-  are available by ftp in ftp.adelaide.edu.au:/pub/compression/lzrw*.
+  file systems with transparent compression. The lzrw series of algorithms
+  are available at http://www.ross.net/compression/.
 
 - Add a super-tight (but slow) compression method, suitable for long
-  term archives.  One problem is that the best versions of arithmetic
-  coding are patented (4,286,256 4,295,125 4,463,342 4,467,317
-  4,633,490 4,652,856 4,891,643 4,905,297 4,935,882 4,973,961
-  5,023,611 5,025,258).
+  term archives.  See, for example, US Patents 4,286,256 4,295,125
+  4,463,342 4,467,317 4,633,490 4,652,856 4,891,643 4,905,297
+  4,935,882 4,973,961 5,023,611 5,025,258, which have all expired.
+  More recent patent-free techniques may also be available.
 
   Note: I will introduce new compression methods only if they are
   significantly better in either speed or compression ratio than the
@@ -59,7 +57,7 @@ Some of the planned features include:
 
   For one possible approach to this, please see:
 
-    http://www.samba.org/netfilter/diary/gzip.rsync.patch
+    https://ozlabs.org/~rusty/gzip.rsync.patch
 
 - Use a larger window size to deal with some large redundant files that
   'compress' currently handles better than gzip.