From 35b704698fc5c31d0fe88e1701239f95b8c67b03 Mon Sep 17 00:00:00 2001 From: Mark Spanbroek Date: Tue, 26 Sep 2023 13:27:24 +0200 Subject: [PATCH] Fix typo --- design/proof-erasure-coding.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/design/proof-erasure-coding.md b/design/proof-erasure-coding.md index f397cd3..dee140b 100644 --- a/design/proof-erasure-coding.md +++ b/design/proof-erasure-coding.md @@ -82,7 +82,7 @@ sampling parity data from that polynomial. This only works for small amounts of data. When the polynomial is for instance -defined over byte sized elements from a Galios field of 2^8, you can only encode +defined over byte sized elements from a Galois field of 2^8, you can only encode 2^8 = 256 bytes (data and parity combined). Interleaving