X-Git-Url: https://wimlib.net/git/?p=wimlib;a=blobdiff_plain;f=src%2Fcompress_common.c;h=270b8cfe3b4ffd410a2cc02e0247e3327846f4a0;hp=959e1deb2d704b359acba3cdb4a8d5b1b04d3522;hb=fe548d263d477a745dfa5057f540cc5c35ecce89;hpb=55f1b41f8c2e4b53fbdd1f601389abc49795e4d4

diff --git a/src/compress_common.c b/src/compress_common.c
index 959e1deb..270b8cfe 100644
--- a/src/compress_common.c
+++ b/src/compress_common.c
@@ -552,8 +552,8 @@ gen_codewords(u32 A[restrict], u8 lens[restrict],
  * approximately (with the algorithm used here) the minimum weighted path
  * length from the root, given this constraint.
  *
- * A canonical Huffman code satisfies the properties that a codeword
- * never lexicographically precedes a shorter codeword, and the
+ * A canonical Huffman code satisfies the properties that a longer
+ * codeword never lexicographically precedes a shorter codeword, and the
  * lexicographic ordering of codewords of the same length is the same as
  * the lexicographic ordering of the corresponding symbols.  A canonical
  * Huffman code, or more generally a canonical prefix code, can be