owengavi2/lab_encoding
1
0
Fork 0
generated from mwc/lab_encoding
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

completed checkpoint 3

Browse Source
This commit is contained in:
owengavi2
2026-03-09 13:59:17 -04:00
parent c61ab09cd7
commit 2eda827bf3
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
questions.md
View File

@@ -116,4 +116,4 @@ An integer + its negative should be 0. Since 0 is already 0, nothing needs to ch
Make a hypothesis about how this could work.
The fist byte or bytes store how to find a character. If they are all 0s, the decoder can move to the next bit and just read that. if it contains 10000000, it needs 2 bytes, 11000000 it needs 3, etc. If there is just one byte that determines length, we can have characters up to 255 bits long (not including location byte). This gives 255 x 8 = 2040 which allows for 2^2040 characters. This seems to be a plausable amount of room to encode every character from every langauge.