From 7a43ed072754b119ef7be12e4d3a79bad6217d1d Mon Sep 17 00:00:00 2001 From: IonutParau Date: Mon, 14 Jul 2025 18:12:35 +0200 Subject: [PATCH] small tweak --- specs/data.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/specs/data.md b/specs/data.md index a62a35b..930c14e 100644 --- a/specs/data.md +++ b/specs/data.md @@ -11,7 +11,7 @@ This also means when decoding, the length must be even. A byte is split into 2 nibbles, with the one comprised of the lowest bits first. Each nibble is ECC encoded separately. -In a nibble there are 4 bits d0, d1, d2 and d3, where dN refers to the bit with value 2^N (2 to the N). +In a nibble there are 4 bits d0, d1, d2 and d3, from lowest to highest. In the output, there are p0, p1, p2, p3 bits, where p1 and above represent hamming code parity data, and p0 is a parity check on the whole block. ### Nibble arrangement @@ -27,4 +27,6 @@ In the output, there are p0, p1, p2, p3 bits, where p1 and above represent hammi | p3 | d1 | d2 | d3 | ``` +The bits are arranged such that p0 is the lowest bit and d3 is the highest. + This creates a fairly generic hamming code structure. Do note that p0 is the bit for checking the whole block's parity.