Corrections [to "An algorithm for linear inequalities and applications" and to "Logical design of analog-to-digital converters"]

Two corrections are presented: (1) The authors of the paper "An Algorithm for Linear Inequalities and Applications," which appeared on pages 683-688 of the October, 1965, issue of these Transactions, has called the following to the attention of the Editor. It was established in this paper that the algorithm converges to the solution (if one exists) in a finite number of steps and that the convergence is exponential. We would like to point out that, for any finite algorithm, exponential convergence is superfluous since it is always possible to find an exponential trajectory which dominates any strictly decreasing and finite trajectory. The particular proof for exponential convergence in the paper is, however, erroneous. Nevertheless, this fact "will not disturb any of the results, theoretical or experimental, mentioned in the paper. We would like to thank C.C. Blaydon for this correction and Prof. T.M. Cover for his suggestions during the review of the paper. Correction (2): The author of the short note "Logical Design of Analog-to-Digital Converters," which appeared on pages 740-741 of the October, 1965, issue of these Transactions, has called the following to the attention of the Editor. On page 740, column 2, the next to the last line, there is a comma after "the most significant bit" which should be deleted.