This paper presents a coding system for extracting bytes from a shared 16×16 byte table using two compact lookup tables. A Relationship Table of 24 entries (all permutations of four indexed units) fixes which units form the table’s row and column axes. A Cases Table of 16 entries selects which bit of each 2-bit pair is used. Bytes are located by an intersection method that matches the k-th set bit on the row axis with the k-th set bit on the column axis.
Each control code is a relationship letter followed by a case icon (e.g. H5). A four-code string such as H5H5V8W3 is transmitted in 6 bytes and yields 16 bytes from the table. The paper gives formal definitions, closed-form ordering rules for both tables, a worked example, and an information-theoretic analysis. It shows that the scheme works as an addressing method over a shared table, not as general-purpose compression. Version 2 adds subject classification, related work and an extended reference list.