amend

minimum_redundancy/README.md

@@ -2,12 +2,10 @@
 
 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:
+The high efficiency of `minimum_redundancy` is confirmed by benchmarks included in (please cite this paper if you are using `minimum_redundancy` for research purposes):
 - 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>.
 
-(Please cite the above paper if you are using `minimum_redundancy` for research purposes.)
-
 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
 - A. Moffat, J. Katajainen, *In-Place Calculation of Minimum-Redundancy Codes*.