Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
On Dyadic Parity Check Codes And Their Generalizations, Meraiah Martinez
On Dyadic Parity Check Codes And Their Generalizations, Meraiah Martinez
Department of Mathematics: Dissertations, Theses, and Student Research
In order to communicate information over a noisy channel, error-correcting codes can be used to ensure that small errors don’t prevent the transmission of a message. One family of codes that has been found to have good properties is low-density parity check (LDPC) codes. These are represented by sparse bipartite graphs and have low complexity graph-based decoding algorithms. Various 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 tractable decoder performance analysis. …
Partitions Of R^N With Maximal Seclusion And Their Applications To Reproducible Computation, Jason Vander Woude
Partitions Of R^N With Maximal Seclusion And Their Applications To Reproducible Computation, Jason Vander Woude
Department of Mathematics: Dissertations, Theses, and Student Research
We introduce and investigate a natural problem regarding unit cube tilings/partitions of Euclidean space and also consider broad generalizations of this problem. The problem fits well within a historical context of similar problems and also has applications to the study of reproducibility in randomized computation.
Given $k\in\mathbb{N}$ and $\epsilon\in(0,\infty)$, we define a $(k,\epsilon)$-secluded unit cube partition of $\mathbb{R}^{d}$ to be a unit cube partition of $\mathbb{R}^{d}$ such that for every point $\vec{p}\in\R^d$, the closed $\ell_{\infty}$ $\epsilon$-ball around $\vec{p}$ intersects at most $k$ cubes. The problem is to construct such partitions for each dimension $d$ with the primary goal of minimizing …
Combinatorics Using Computational Methods, Derrick Stolee
Combinatorics Using Computational Methods, Derrick Stolee
Department of Mathematics: Dissertations, Theses, and Student Research
Computational combinatorics involves combining pure mathematics, algorithms, and computational resources to solve problems in pure combinatorics. This thesis provides a theoretical framework for combinatorial search, which is then applied to several problems in combinatorics. Some results in space-bounded computational complexity are also presented.