In recent years there has been a growing interest in codes from graphs.
It has been shown that such codes exist that can be decoded in linear-time complexity, such that the code rate is bounded away from zero. The same is the case for the fraction of symbols that are allowed to be in error.
The objective of this project is to use algebraic and algebraic geometry tools to get better bounds on the minimum distance of a class of graph codes and also to improve on the en- and decoding of these codes.
The project is part of the new Danish-Chinese Center for Applications of Algebraic Geometry in Coding Theory and Cryptography.
Contact persons: Tom Høholdt and Peter Beelen