The closest vector problem in q-ary lattices
No Thumbnail Available
Journal Title
Journal ISSN
Volume Title
Perustieteiden korkeakoulu |
Bachelor's thesis
Electronic archive copy is available locally at the Harald Herlin Learning Centre. The staff of Aalto University has access to the electronic bachelor's theses by logging into Aaltodoc with their personal Aalto user ID. Read more about the availability of the bachelor's theses.
Author
Date
2017-09-02
Department
Major/Subject
Matematiikka ja systeemitieteet
Mcode
SCI3029
Degree programme
Teknillinen fysiikka ja matematiikka TFM
Language
en
Pages
50
Series
Description
Supervisor
Greferath, MarcusThesis advisor
Blomqvist, FerdinandKeywords
closest vector problem, linear code, q-ary code, single parity-check code, SPC-lattice, Babai's algorithm
