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 12 of 12 for “"Stopping sets"”.
-
Codes on Graphs and Analysis of Iterative Algorithms for Reconstructing Sparse Signals and Decoding of Check-Hybrid GLDPC Codes
… corresponding to the measurement matrix called stopping sets and analyze the failures and successes of the IPA on subsets of stopping sets. We provide sufficient conditions under which the IPA succeeds the recovery of the signal. Reconstruction performance of the IPA using different LDPC …
-
Belief Propagation Decoding of Finite-Length Polar Codes
… High errors are related to the so-called stopping sets of the underlying graphs. we discuss the pros and cons of BP decoder over SC decoder for various code lengths.
-
Design and Analysis of Graph-based Codes Using Algebraic Lifts and Decoding Networks
… Graphical substructures called trapping sets, absorbing sets, and stopping sets characterize failure of these algorithms at high signal-to-noise ratios. This dissertation focuses on code design for and analysis of iterative graph-based message-passing decoders. The main contributions of …
-
Half-Product Codes
… product codes. They also have a larger minimum stopping-set size under iterative decoding which provides better scaling. The main results of this thesis are summarized as follows: 1. Encoding and decoding methods of half-product codes are described. 2. The minimum distance of these codes is …
-
On Dyadic Parity Check Codes and Their Generalizations
… graphical properties, such as the girth and stopping sets, influence when these algorithms might fail. Additionally, codes based on algebraically structured parity check matrices are desirable in applications due to their compact representations, practical implementation advantages, and …
-
Optimal Stopping Problems with A Random Time Horizon
The theory of optimal stopping provides a powerful set of tools for the study of American contingent claim pricing problem in mathematical finance. We give a self-contained overview of the theory, including the complete proofs of existence and uniqueness theorems for the optimal stopping time in …
-
Characterization of Problematic Graphical Structures of LDPC Codes and the Corresponding Efficient Search Algorithms
… These graphical structures are:LETSs,ETSs,NETSs,stopping setsandcodewords. First, we complement LSS characterization by demonstrating how the remaining structures of LETSs can be characterized. Then, we propose a new characterization for LETSs of variable-regular LDPC codes. Compared to the …
-
Applications of graph-based codes in networks: analysis of capacity and design of improved algorithms
… addresses the structural characterization of stopping sets to understand this sub-optimality. Using this characterization, a novel improved decoder that offers several orders of magnitude improvement in bit-error rates is introduced. Next, a novel scheme for the design of a good …
-
On Cyclic Polar Codes and the Burst Erasure Performance of Spatially-Coupled LDPC Codes
… vector describing distinct types of size-2 stopping sets. All these results are verified using Monte-Carlo simulations. Further, we show that increasing variable node degree combined with expurgation can improve PB by several orders of magnitude in the number of bits per coupled code.
-
Iterative Decoding of Codes on Graphs
… into two categories by defining trapping sets and propagating sets. Such a classification leads to a successful estimation of the performance of codes under the Gallager B decoder. Especially, the estimation techniques show great promise in the high signal-to-noise ratio regime where the …
-
Low Complexity Iterative Algorithms in Channel Coding and Compressed Sensing
… the failures of the IPA and link them to the stopping sets of the binary representation of the sparse measurement matrices used. The performance of the IPA makes it a good trade-off between the complex ℓ₁-minimization reconstruction and the very simple verification decoding. The measurement …
-
Physical-layer security: practical aspects of channel coding and cryptography
… for legitimate receivers. Our codes are called stopping set codes, and provide a blanket of security that covers nearly all possible system configurations and channel parameters. The codes require a public authenticated feedback channel. The solutions to these two problems indicate the inherent …