aboutsummaryrefslogtreecommitdiff
path: root/BinaryEncoding.md
diff options
context:
space:
mode:
Diffstat (limited to 'BinaryEncoding.md')
-rw-r--r--BinaryEncoding.md7
1 files changed, 1 insertions, 6 deletions
diff --git a/BinaryEncoding.md b/BinaryEncoding.md
index 940c962..bfdbe30 100644
--- a/BinaryEncoding.md
+++ b/BinaryEncoding.md
@@ -16,12 +16,7 @@ The encoding is split into three layers:
The structural compression introduces more efficient encoding of values,
rearranges values within the module, and prunes structurally identical
tree nodes.
-* **Layer 2** applies generic compression techniques, already available
- in browsers and other tooling. Algorithms as simple as gzip can deliver
- good results, but more sophisticated algorithms like
- [LZHAM](https://github.com/richgel999/lzham_codec) and
- [Brotli](https://datatracker.ietf.org/doc/draft-alakuijala-brotli/) are able
- to deliver dramatically smaller files.
+* **Layer 2** Layer 2 applies generic compression algorithms, like [gzip](http://www.gzip.org/) and [Brotli](https://datatracker.ietf.org/doc/draft-alakuijala-brotli/), that are already available in browsers and other tooling.
Most importantly, the layering approach allows development and standardization to
occur incrementally. For example, Layer 1 and Layer 2 encoding techniques can be