Study of Optimal Linear Batch Codes
Name
Mart Simisker
Abstract
Linear batch codes can be used for load balancing in distributed storage systems. In order to obtain efficient performance, it is important to have codes with optimized parameters, which is a complicated mathematical problem.
Specifically, in this thesis, algorithms and software for searching for linear batch codes are presented. Two upper bounds for systematic linear batch codes are derived. The shortest lengths of systematic linear batch codes, which have been found with the help of the software, are compared to known upper and lower bounds.
Specifically, in this thesis, algorithms and software for searching for linear batch codes are presented. Two upper bounds for systematic linear batch codes are derived. The shortest lengths of systematic linear batch codes, which have been found with the help of the software, are compared to known upper and lower bounds.
Graduation Thesis language
English
Graduation Thesis type
Bachelor - Computer Science
Supervisor(s)
Vitaly Skachek
Defence year
2017