dc.contributor.author | Persson, Palma Rud | |
dc.date.accessioned | 2023-06-12T23:51:57Z | |
dc.date.available | 2023-06-12T23:51:57Z | |
dc.date.issued | 2023-06-01 | |
dc.date.submitted | 2023-06-12T22:03:03Z | |
dc.identifier.uri | https://hdl.handle.net/11250/3071000 | |
dc.description.abstract | The secrecy gain of Construction A lattices obtained by tail-biting rate 1/2 convolutional codes is studied to evaluate the secrecy performance of a lattice in a wiretap channel communication. The higher the secrecy gain, the more difficult for an eavesdropper to correctly guess the transmitted message. To explore the best potential secrecy gain, an exhaustive search is conducted, considering various constraint lengths and even code lengths up to 100. The methods' validity is verified by evaluating the minimum free distance and comparing the results with known findings. This investigation identifies outcomes close to the upper bound of unimodular lattices. | |
dc.language.iso | eng | |
dc.publisher | The University of Bergen | |
dc.rights | Copyright the Author. All rights reserved | |
dc.title | Tail-biting Codes for Lattice Wiretap Coding | |
dc.type | Master thesis | |
dc.date.updated | 2023-06-12T22:03:03Z | |
dc.rights.holder | Copyright the Author. All rights reserved | |
dc.description.degree | Masteroppgave i informatikk | |
dc.description.localcode | INF399 | |
dc.description.localcode | MAMN-PROG | |
dc.description.localcode | MAMN-INF | |
dc.subject.nus | 754199 | |
fs.subjectcode | INF399 | |
fs.unitcode | 12-12-0 | |