diff --git a/draft-ietf-quic-recovery.md b/draft-ietf-quic-recovery.md
index 2d585a94da..ad96b97d6f 100644
--- a/draft-ietf-quic-recovery.md
+++ b/draft-ietf-quic-recovery.md
@@ -744,9 +744,9 @@ their delivery to the peer.
 
 Sending multiple packets into the network without any delay between them
 creates a packet burst that might cause short-term congestion and losses.
-Implementations MUST either use pacing or limit such bursts to the minimum
-of 10 * kMaxDatagramSize and max(2* kMaxDatagramSize, 14720)), the same
-as the recommended initial congestion window.
+Implementations MUST either use pacing or limit such bursts to the initial
+congestion window, which is recommended to be the minimum of
+10 * kMaxDatagramSize and max(2* kMaxDatagramSize, 14720)).
 
 As an example of a well-known and publicly available implementation of a flow
 pacer, implementers are referred to the Fair Queue packet scheduler (fq qdisc)