A standard correction for random guessing (cfg) formula on multiple-choice and Yes/Noexaminations was examined retrospectively in the scores of the intermediate female EFL learners in an English language school. The correctionwas a weighting formula for points awarded for correct answers,incorrect answers, and unanswered questions so that the expectedvalue of the increase in test score due to g...

Error correction techniques traditionally focus on the co-design of restricted code-structures in tandem with code-specific decoders that are computationally efficient when decoding long codes hardware. Modern applications are, however, driving demand for ultra-reliable low-latency communications (URLLC), rekindling interest performance shorter, higher-rate error correcting codes, and raising p...

The problem of guessing a random string is revisited. The relationship between guessing without distortion and compression is extended to the case when source alphabet size is countably infinite. Further, similar relationship is established for the case when distortion allowed by establishing a tight relationship between rate distortion codes and guessing strategies.

The problem of guessing a random string is studied. It arises in the analysis of the strength of secret-key cryptosystems against guessing attacks. Expected number of guesses, or more generally moments of the number of guesses needed to break the cryptosystem grow exponentially with the length of the string. This thesis studies the rate of exponential growth of these moments using the theory of...

Multiple-choice (MC) items are widely used in educational tests. Distractor analysis, an important procedure for checking the utility of response options within MC item, can be readily implemented framework item theory (IRT). Although random guessing is a popular behavior test-takers when answering items, none existing IRT models distractor analysis have considered influence this process. In ar...

We obtain minimax lower bounds on the regret for the classical two-armed bandit problem. We provide a finite-sample minimax version of the well-known log asymptotic lower bound of Lai and Robbins. The finite-time lower bound allows us to derive conditions for the amount of time necessary to make any significant gain over a random guessing strategy. These bounds depend on the class of possible d...

The design and implementation of error correcting codes has long been informed by two fundamental results: Shannon’s 1948 capacity theorem, which established that use noisy channels most efficiently; Berlekamp, McEliece, Van Tilborg’s 1978 theorem on the NP-completeness decoding linear codes. These results shifted focus away from creating code-independent decoders, but recent low-...