Prefer a chat interface with context about you and your work?
The Meet Operation in the Imbalance Lattice of Maximal Instantaneous Codes: Alternative Proof of Existence
An alternative proof is given of the existence of greatest lower bounds in the imbalance order of binary maximal instantaneous codes of a given size. These codes are viewed as maximal antichains of a given size in the infinite binary tree of 0–1 words. The proof proposed makes use of …