On the decoder error probability for Reed-Solomon codes

Upper bounds On the decoder error probability for Reed-Solomon codes are derived. By definition, "decoder error" occurs when the decoder finds a codeword other than the transitted codeword; this is in contrast to "decoder failure," which occurs when the decoder fails to find any codeword at all. These results imply, for example, that for a t error-correcting Reed-Solomon code of length q - 1 over GF(q), if more than t errors occur, the probability of decoder error is less than 1/t!

An entropy maximization problem related to optical communication

Motivated by a problem in optical communication, we consider the general problem of maximizing the entropy of a stationary random process that is subject to an average transition cost constraint. Using a recent result of Justenson and Hoholdt, we present an exact solution to the problem and suggest a class of finite state encoders that give a good approximation to the exact solution

PSL-An Expert System to Evaluate Degree Plans

This paper describes a general-purpose expert system to evaluate degree plans according to the individual preferences of a college student. This system implements a preference specification language (PSL) on top of this expert system to allow for the textual expression of certain requirements and preferences that the system uses for evaluation. The PSL evaluator produces a single value to describe how well it meets the student’s preferences, which a plan generation system could use to create a degree plan optimized according to the specification