Professor, Dept. of Mathematics and Dept. of Electrical Engineering, UW-Madison
A good code has both rate k/n and relative minimum distance d/n large. The fundamental question of coding theory is to describe the closure of the set of points (d/n,k/n). Goppa’s conjecture says that, except for isolated points, it’s the region below the curve y=1-H(x) for x
The Belgian chocolate problem asks for the range of a process parameter for which simultaneous stabilization of three processes by a rational controller is possible. In this talk I introduce a new algebraic method that produces solutions with larger process parameters than standard optimization techniques yield. These solutions turn out …