Show simple item record

dc.contributor.authorPersson, Palma Rud
dc.date.accessioned2023-06-12T23:51:57Z
dc.date.available2023-06-12T23:51:57Z
dc.date.issued2023-06-01
dc.date.submitted2023-06-12T22:03:03Z
dc.identifier.urihttps://hdl.handle.net/11250/3071000
dc.description.abstractThe 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.isoeng
dc.publisherThe University of Bergen
dc.rightsCopyright the Author. All rights reserved
dc.titleTail-biting Codes for Lattice Wiretap Coding
dc.typeMaster thesis
dc.date.updated2023-06-12T22:03:03Z
dc.rights.holderCopyright the Author. All rights reserved
dc.description.degreeMasteroppgave i informatikk
dc.description.localcodeINF399
dc.description.localcodeMAMN-PROG
dc.description.localcodeMAMN-INF
dc.subject.nus754199
fs.subjectcodeINF399
fs.unitcode12-12-0


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record