B15
Error correction in communications, computation, and biology
Which errors can each encoding recover, and what physical resources does recovery consume?

VI.11 / BIOLOGICAL
How much information about an input can be recovered from a noisy biological response? Trace how the estimate changes with sampling interval and background variability.
Biochemical signaling converts molecular encounters into changes in cellular behavior. Berg and Purcell's chemoreception analysis offers a physical way to ask how accurately a cell can estimate a concentration from finite encounters. Information here is tied to a particular signal, receptor, time window, and response. The practical question is how noise and resource limits shape discrimination between environmental conditions.
Imagine counting independent molecular encounters over equal intervals. If the expected count is 25, a Poisson model gives a standard deviation of five, or 20 percent of the mean. At an expected count of 100, the relative spread becomes 10 percent. Then inspect which biological correlations would make this simple independence assumption fail.
Use a simple counting model to predict sensing precision, then compare the assumptions with one documented receptor system.
These models isolate a mechanism you can vary. Their assumptions define the part of this topic they can illuminate.
Change one parameter, compare the numerical output, and export the result. The experiment loads when you open it.
Compare symbol frequencies with the ordering that a code can exploit.
The first sweep changes the probability of A while drawing each symbol independently. The other three symbols share the remaining probability.
As one symbol dominates, the observed symbol entropy falls. Huffman codes use short words for frequent symbols; the comparison excludes headers and the codebook.
The second sweep gives all four new draws equal probability and increases repetition. Long runs reward run-length coding, even when a symbol histogram cannot describe the dependence.
Method. The histogram gives an order-zero Shannon entropy. Huffman coding repeatedly joins the two least frequent branches to build a prefix code. The run-length format stores a two-bit symbol and an eight-bit count; counts run from 1 to 255, and a longer run uses another packet.
Howard C. Berg and Edward M. Purcell · Physical limits and sampling considerations in chemical sensing.
B15
Which errors can each encoding recover, and what physical resources does recovery consume?
B21
How does an open system’s measured energy budget constrain the work it can perform?