Explicit Construction of Global Function Fields with Many Rational Places. The use of error-correcting codes and cryptosystems is fundamental to the secure and reliable operation of many technological devices that we depend upon in our everyday lives. Essentially invisible, both coding theory and cryptography are essential for banking (ATM machines, e-banking), commerce (e-commerce), defense (cryptography) and entertainment (digital TV and radio, music CDs, DVDs). While certain families of "goo ....Explicit Construction of Global Function Fields with Many Rational Places. The use of error-correcting codes and cryptosystems is fundamental to the secure and reliable operation of many technological devices that we depend upon in our everyday lives. Essentially invisible, both coding theory and cryptography are essential for banking (ATM machines, e-banking), commerce (e-commerce), defense (cryptography) and entertainment (digital TV and radio, music CDs, DVDs). While certain families of "good" codes and cryptosystems can be constructed from specific function fields whose existence is guaranteed by abstract theory, often no actual construction for the function field is currently known. We aim to close this gap, making a greater range of "good" codes and cryptosystems available for practical applications.
Read moreRead less
Composition tree algorithms for large matrix groups. This project aims to develop new algorithms for analysing groups. A group is a rather simple mathematical structure – an example is the set of all integers considering only the operations of addition and subtraction. Since the symmetries of an object form a group, groups are ubiquitous throughout mathematics and elsewhere in science. Because it is frequently necessary to determine a group's properties, there is great interest in finding effici ....Composition tree algorithms for large matrix groups. This project aims to develop new algorithms for analysing groups. A group is a rather simple mathematical structure – an example is the set of all integers considering only the operations of addition and subtraction. Since the symmetries of an object form a group, groups are ubiquitous throughout mathematics and elsewhere in science. Because it is frequently necessary to determine a group's properties, there is great interest in finding efficient algorithms for analysing groups. A matrix group is a common type of group whose elements are square matrices. This project plans to employ a novel approach to designing algorithms for analysing large matrix groups, a task which is currently impossible using existing algorithms.Read moreRead less