doc. fix

minimum_redundancy/README.md

@@ -5,6 +5,7 @@ The library is fast and consumes low memory both to construct (which is done wit
 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>.
+
 (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: