The closest vector problem in q-ary lattices
dc.contributor | Aalto-yliopisto | fi |
dc.contributor | Aalto University | en |
dc.contributor.advisor | Blomqvist, Ferdinand | |
dc.contributor.author | Korvuo, Juuso | |
dc.contributor.school | Perustieteiden korkeakoulu | fi |
dc.contributor.supervisor | Greferath, Marcus | |
dc.date.accessioned | 2017-10-31T10:10:14Z | |
dc.date.available | 2017-10-31T10:10:14Z | |
dc.date.issued | 2017-09-02 | |
dc.format.extent | 50 | |
dc.format.mimetype | application/pdf | en |
dc.identifier.uri | https://aaltodoc.aalto.fi/handle/123456789/28579 | |
dc.identifier.urn | URN:NBN:fi:aalto-201710317423 | |
dc.language.iso | en | en |
dc.programme | Teknillinen fysiikka ja matematiikka TFM | fi |
dc.programme.major | Matematiikka ja systeemitieteet | di |
dc.programme.mcode | SCI3029 | fi |
dc.subject.keyword | closest vector problem | en |
dc.subject.keyword | linear code | en |
dc.subject.keyword | q-ary code | en |
dc.subject.keyword | single parity-check code | en |
dc.subject.keyword | SPC-lattice | en |
dc.subject.keyword | Babai's algorithm | en |
dc.title | The closest vector problem in q-ary lattices | en |
dc.type | G1 Kandidaatintyö | fi |
dc.type.dcmitype | text | en |
dc.type.ontasot | Bachelor's thesis | en |
dc.type.ontasot | Kandidaatintyö | fi |