| 摘要 |
A message is encoded into an array, which is an element of a constrained array set. The message is encoded by considering candidates for each entry (e.g., column, bit) of the array. The candidates have a predetermined ordering. For each candidate that is considered, a lower bound is determined. The lower bound indicates a number of set elements including both the candidate being considered and previously selected candidates of the array. An entry is filled with a candidate based upon the value of the lower bound relative to an intermediate message. The intermediate message is initially equal to the message being encoded, and is updated after each column of the array has been filled.
|
