Polar Codes for secure binary Wyner-Ziv source coding

University essay from KTH/Teknisk informationsvetenskap

Author: Raees Kizhakkumkara Muhamad; [2017]

Keywords: ;

Abstract: Source coding, originally envisaged by Claude Shannon in 1948 in his landmarkpaper "A Mathematical Theory of Communication" remained impractical forthe most part of the 20th century. However several advances were made incoding theory of which the latest-Polar Codes introduced by Erdal Arikan in2008 is highly promising. Polar Codes have modest encoding and decoding complexities,while providing a construction that directly leads to the fundamentalbounds obtained by Shannon. We are progressing further into the InformationAge, where high resolution videos are streamed over the Internet and variousdevices gather massive amounts of data while connected to each other in communicationnetworks. Hence the practical implication of an ecient and securesource coding scheme is signicant. In this thesis, we implement a source codingproblem called the Common helper in a Wyner-Ziv Network using polarcodes. Additionally the above construction leads to the lossy compression of aBernoulli Source and might provide an insight on how to develop ecient lossysource compression over a more general network.Source coding, originally envisaged by Claude Shannon in 1948 in his landmarkpaper "A Mathematical Theory of Communication" remained impractical forthe most part of the 20th century. However several advances were made incoding theory of which the latest-Polar Codes introduced by Erdal Arikan in2008 is highly promising. Polar Codes have modest encoding and decoding complexities,while providing a construction that directly leads to the fundamentalbounds obtained by Shannon. We are progressing further into the InformationAge, where high resolution videos are streamed over the Internet and variousdevices gather massive amounts of data while connected to each other in communicationnetworks. Hence the practical implication of an ecient and securesource coding scheme is signicant. In this thesis, we implement a source codingproblem called the Common helper in a Wyner-Ziv Network using polarcodes. Additionally the above construction leads to the lossy compression of aBernoulli Source and might provide an insight on how to develop ecient lossysource compression over a more general network.

  AT THIS PAGE YOU CAN DOWNLOAD THE WHOLE ESSAY. (follow the link to the next page)