Manuscript En02-B@1 · En02-B-v1.tex · section · ca28dee4
Encoding and accessible leaves
A finite perfect-code tree and decoder schedules › Encoding and accessible leaves · lines 1335–1340
This proof also establishes correctness when the intermediate logical inputs are entangled with other nodes. No product-input assumption is used.