[DMANET] Marie Curie postdoc calls for expression of interest.

Dear all,

The department 'Mathematical Foundations of Informatics' (MFI) of the Institute of Mathematics and Informatics of the Bulgarian Academy of Sciences welcomes expressions of interest by postdoctoral researchers, offering to host highly motivated mathematicians and computer scientists, who wish to apply for a Marie Sklodowska-Curie Posdoctoral Fellowship or a National Scientific Programme 'Petar Beron' Fellowship.


Selected candidates, together with a supervisor and an advisor from the Institute of Mathematics and Informatics are expected to develop a joint research proposal that falls broadly under one or more of the following topics:

* Optimal Codes (with prof. Iliya Bouyukliev)
* Bounds for codes and designs in polynomials metric spaces (PM-spaces) (with prof. Peter Boyvalenkov)
* Cryptographically strong S-boxes (with prof. Tsonka Baycheva)
* Combinatorics and finite geometry related to coding theory and cryptography (with prof. Svetlana Topalova and/or assoc. prof. Stela Zhelezova)
* Finite geometries and their applications to coding theory (with prof. Ivan Landjev)

More information can be found at https://math.bas.bg/en/2021/04/expression-of-interest-postdoc-positions-possible-in-coding-theory/

Young researchers, interested in applying for a fellowship and work in one of the above fields should send a CV and list of publications to director@math.bas.bg with a copy to peter@math.bas.bg. Inquiries may be sent to toty@math.bas.bg<mailto:toty@math.bas.bg>

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************