Documentation/staging: Fix typo and incorrect citation in crc32.rst

In Documentation/staging/crc32.rst, below errors have been corrected:

1. Line 37: from "to being" to "to bring"

2. Line 119:  Incorrect citation date:
   It must be August 1988 instead of August 1998

Signed-off-by: Rakuram Eswaran <rakuram.e96@gmail.com>
Link: https://lore.kernel.org/r/20250820162615.6942-1-rakuram.e96@gmail.com
Signed-off-by: Eric Biggers <ebiggers@kernel.org>

diff --git a/Documentation/staging/crc32.rst b/Documentation/staging/crc32.rst
index 7542220967cb4c3366665ee7a7730b62ae44bcdb..64f3dd430a6ca7f31313dcb8b546d4149578e9ac 100644 (file)
--- a/Documentation/staging/crc32.rst
+++ b/Documentation/staging/crc32.rst
@@ -34,7 +34,7 @@ do it in the right order, matching the endianness.
 Just like with ordinary division, you proceed one digit (bit) at a time.
 Each step of the division you take one more digit (bit) of the dividend
 and append it to the current remainder.  Then you figure out the
-appropriate multiple of the divisor to subtract to being the remainder
+appropriate multiple of the divisor to subtract to bring the remainder
 back into range.  In binary, this is easy - it has to be either 0 or 1,
 and to make the XOR cancel, it's just a copy of bit 32 of the remainder.
 
@@ -116,7 +116,7 @@ for any fractional bytes at the end.
 To reduce the number of conditional branches, software commonly uses
 the byte-at-a-time table method, popularized by Dilip V. Sarwate,
 "Computation of Cyclic Redundancy Checks via Table Look-Up", Comm. ACM
-v.31 no.8 (August 1998) p. 1008-1013.
+v.31 no.8 (August 1988) p. 1008-1013.
 
 Here, rather than just shifting one bit of the remainder to decide
 in the correct multiple to subtract, we can shift a byte at a time.