Login
 Forum
 
 
Thesis topic proposal
 
István Földes
Combinatorics of data compression codes

THESIS TOPIC PROPOSAL

Institute: University of Miskolc
computer sciences
JÓZSEF HATVANY DOCTORAL SCHOOL FOR COMPUTER SCIENCE AND ENGINEERING

Thesis supervisor: István Földes
Location of studies (in Hungarian): Institute of Informatics
Abbreviation of location of studies: INF


Description of the research topic:

Codes as sets of finite sequences of symbols (codewords) are studied based on their mathematical properties, using the methods of discrete
mathematics. These properties relate on the one hand to the relationships
of codewords among each other (word transformations, distance), and on the other hand to the relationships between codes as collections of words (coding functions, exchange operations, majorization). Among the relevant discrete mathematical structures graphs, trees, ordered sets, lattices and semigroups play a prominent role.

Required language skills: angol
Number of students who can be accepted: 1

Deadline for application: 2021-10-01


2024. IV. 17.
ODT ülés
Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).

 
All rights reserved © 2007, Hungarian Doctoral Council. Doctoral Council registration number at commissioner for data protection: 02003/0001. Program version: 2.2358 ( 2017. X. 31. )