mr benchmark note

README.md

@@ -26,8 +26,7 @@ Everything is dual-licensed under [Apache 2.0](LICENSE-APACHE) or [MIT](LICENSE-
 
 # Bibliography
 When using `bsuccinct` for research purposes, please cite the following paper:
-
-* Piotr Beling, *BSuccinct: Rust libraries and programs focused on succinct data structures*, SoftwareX, Volume 26, 2024, 101681, ISSN 2352-7110,
+- Piotr Beling, *BSuccinct: Rust libraries and programs focused on succinct data structures*, SoftwareX, Volume 26, 2024, 101681, ISSN 2352-7110,
 <https://doi.org/10.1016/j.softx.2024.101681>
 
 # Installation

minimum_redundancy/README.md

@@ -1,6 +1,10 @@
 `minimum_redundancy` is the Rust library by Piotr Beling to encode and decode data with binary or non-binary minimum-redundancy (Huffman) coding.
 
-The library is fast and consumes low memory both to construct (which is done without explicitly building a tree) and store the coding dictionary (it only stores frequency-sorted symbols and the numbers of non-leaf nodes at successive levels of the canonical Huffman tree). In addition, the implementation is generic. It can construct not only binary codes (obtained via binary Huffman trees), but of any arity (trees of any degree).
+The library is fast and consumes low memory both to construct (which is done without explicitly building a tree) and store the coding dictionary (it only stores frequency-sorted symbols and the numbers of non-leaf nodes at successive levels of the canonical Huffman tree). In addition, the implementation is generic. It can construct not only binary codes (obtained via binary Huffman trees), but of any arity (trees of any degree). 
+
+The high efficiency of `minimum_redundancy` is confirmed by benchmarks included in:
+- Piotr Beling, *BSuccinct: Rust libraries and programs focused on succinct data structures*, SoftwareX, Volume 26, 2024, 101681, ISSN 2352-7110,
+<https://doi.org/10.1016/j.softx.2024.101681>.
 
 The library uses improved Huffman algorithm, with ideas from the following papers:
 - A. Brodnik, S. Carlsson, *Sub-linear decoding of Huffman Codes Almost In-Place*, 1998