From ce16c137964b348ef6d5ac8ce9d033a111066d13 Mon Sep 17 00:00:00 2001 From: Christopher Haster Date: Thu, 31 Oct 2024 14:35:50 -0500 Subject: [PATCH] README.md - More references to the code MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Even if they can't be links they at least encourage the reader to look at the code. I personally think the code does a lot to remove the magic of the overall math. Also fixed the reference to ramrsbd_find_λ... --- README.md | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index 81260d5..742d78e 100644 --- a/README.md +++ b/README.md @@ -628,7 +628,7 @@ The actual algorithm itself is relatively simple: shift $C(i)$ every step of the algorithm, we usually don't need to track $m$ explicitly. -This is all implemented in `ramrsbd_find_l`. +This is all implemented in `ramrsbd_find_λ`. #### Solving binary LFSRs for fun @@ -1299,6 +1299,9 @@ Unless of course we had enough errors to end up overcorrecting to a different codeword, but there's not much we can do in that case. No error-correction is perfect. +This is all implemented in `ramrsbd_read`, if you're curious what it +looks like in code. + ## Tricks Heavy math aside, there are a couple minor implementation tricks worth