(no commit message)

diff --git a/openpower/sv/bitmanip.mdwn b/openpower/sv/bitmanip.mdwn
index 2c73eb10809769b7af1259a19fd51fbd677b8d9e..1f63d8bf7d3a09f06f0912ba27ea7fe2cf3bf722 100644 (file)
--- a/openpower/sv/bitmanip.mdwn
+++ b/openpower/sv/bitmanip.mdwn
@@ -549,8 +549,9 @@ is followed by more accurate descriptions:
 * carry-less binary arithmetic. this is not actually a Galois Field,
   but is accidentally referred to as GF(2) - see below as to why.
 * modulo arithmetic with a Prime number, these are "proper" Galois Fields
-* modulo arithmetic with two limits: a power-of-2 (2^N) and a second
-  "reducing" polynomial (similar to a prime number)
+* carry-less binary arithmetic with two limits: modulo a power-of-2 (2^N)
+  and a second "reducing" polynomial (similar to a prime number), these
+  are said to be GF(2^N) arithmetic.
 
 further detailed and more precise explanations are provided below