Optimaalsete lineaarsete partiikoodide uuring
| dc.contributor.advisor | Vitaly Skachek | |
| dc.contributor.author | Simisker, Mart | |
| dc.date.accessioned | 2019-10-15T08:20:59Z | |
| dc.date.available | 2019-10-15T08:20:59Z | |
| dc.date.issued | 2017 | |
| dc.description.abstract | Lineaarseid partiikoode saab kasutada koormuse ühtlustamiseks hajusandmetalletussüsteemides. Selleks, et tagada efektiivne sooritusvõime, on tarvis optimeeritud parameetritega koode. Selliste koodide leidmine on aga keerukas matemaatiline probleem. Selles töös esitatakse algoritme ja tarkvara, mille abil on võimalik uurida lineaarseid partiikoode. Tuletatakse kaks uut ülemtõket lineaarsetele partiikoodidele. Lõpuks võrreldakse tarkvara abil leitud lühimaid süstemaatiliste lineaarsete partiikoodide pikkuseid seni teadaolevate tõketega. | |
| dc.description.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. | |
| dc.identifier.uri | http://hdl.handle.net/10062/65628 | |
| dc.language.iso | en | |
| dc.title | Optimaalsete lineaarsete partiikoodide uuring | |
| dc.title.alternative | Study of Optimal Linear Batch Codes | |
| dc.type | Thesis |
Files
Original bundle
1 - 1 of 1