commit 69ad15638a794fdf4be98f94fbf4a5f6265aeaf6
parent 3ac2fd2e350cfa5608f2396c8a2c20d4de028419
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Sat, 31 May 2025 10:58:20 +0200
commit with codex
Diffstat:
3 files changed, 13 insertions(+), 0 deletions(-)
diff --git a/data_structure b/data_structure
@@ -12,6 +12,7 @@
- [heap]
- [bloom_filter]
- [brodal_queue]
+- [binary_counter]
See also: [sketching], [algorithms]
diff --git a/gray_code b/gray_code
@@ -11,6 +11,8 @@
construction:
- [reflected_binary_code]
+- [pseudo_gray_code]
+
Up: [enumeration]
See also: [middle_levels_conjecture], [torsten]
diff --git a/pseudo_gray_code b/pseudo_gray_code
@@ -0,0 +1,10 @@
+# Pseudo gray code
+
+One possible meaning: like a [Gray_code] but you can flip constantly many bits at every step, not just one
+
+If you want to flip exactly k bits at every step, then for parity reasons no code exists for even k, but a code exists for every odd k, cf
+https://math.stackexchange.com/questions/482044/generalization-of-gray-codes
+
+Up: [gray_code]
+
+See also: [constant_weight_code]
