We make breakthrough theoretical algebra into engineering solutions
We apply sophisticated algebraic and computational tools to represent data in noise-resilient ways
We develop fast, practical algorithms for computers to operate with bleeding-edge theoretical constructions.
We have many projects suitable for anything from Fagproject to PhD level. The project will be tailored for you on a scale between theoretical math and practical implementations.
The article Counting Generalized Reed-Solomon Codes by Peter Beelen, David Glynn, Tom Høholdt and Krishna Kaipa has just appeared in the journal Advances in Mathematics of Communication, volume 11, issue 4, pages 777-790, doi: 10.3934/amc.2017057. The work started by a question of the fourth author posed at a conference in India in 2013 and grew […]
The Algebra group was visited 30th October till 10th November by PhD student David Lucas from University of Grenoble-Alpes in France. David Lucas is looking at non-cryptographic solutions for security issues with cloud computing, and during the visit worked with Johan Rosenkilde on certificates for linear algebraic computations: a cloud service computes e.g. the determinant […]
In a new preprint Peter Beelen and guest Ph.D. Maria Montanucci describe a new family of maximal curves. Maximal curves are algebraic curves defined over a finite field, having as many rational points as allowed by the famous Hasse-Weil bound. Such curves are of great interest by themselves, but are also the most obvious curves […]