Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"Sparse graph codes"”.
-
Complexity constrained design of sparse graph codes
… for the design of capacity-approaching sparsegraph codes, under the assumption of an arbitrary number of decoder iterations. Howeverin many practical situations, latency requirements or hardware constraints maylimit the available number of iterations. This thesis develops methodologies …
-
Applications of Coding Theory to Massive Multiple Access and Big Data Problems
… access and big data. Although bipartite Tanner graphs and low-complexity iterative algorithms such as peeling and message passing decoders are very popular in the channel coding literature they are not as widely used in the respective areas of study and this dissertation serves as an important …
-
Algorithmic and Coding-theoretic Methods for Group Testing and Private Information Retrieval
… We propose non-adaptive QGT algorithms using sparse graph codes over bi-regular and irregular bipartite graphs, and binary t-error-correcting BCH codes. The proposed schemes provide exact recovery with a probabilistic guarantee, i.e. recover all the defective items with high probability. The …
-
Coding techniques for information-theoretic strong secrecy on wiretap channels
… with a specific focus on designing practical codes. The codes designed in this work are based on analysis and techniques from error-correcting codes. In particular, the dual codes of certain low-density parity-check (LDPC) codes are shown to achieve strong secrecy in a coset coding scheme. …