Open Access. Powered by Scholars. Published by Universities.®
- Keyword
Articles 1 - 5 of 5
Full-Text Articles in Mathematics
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. …
Modernization Of Scienttific Mathematics Formula In Technology, Iwasan D. Kejawa Ed.D, Prof. Iwasan D. Kejawa Ed.D
Modernization Of Scienttific Mathematics Formula In Technology, Iwasan D. Kejawa Ed.D, Prof. Iwasan D. Kejawa Ed.D
Department of Mathematics: Faculty Publications
Abstract
Is it true that we solve problem using techniques in form of formula? Mathematical formulas can be derived through thinking of a problem or situation. Research has shown that we can create formulas by applying theoretical, technical, and applied knowledge. The knowledge derives from brainstorming and actual experience can be represented by formulas. It is intended that this research article is geared by an audience of average knowledge level of solving mathematics and scientific intricacies. This work details an introductory level of simple, at times complex problems in a mathematical epidermis and computability and solvability in a Computer Science. …
A Game-Theoretic Analysis Of The Nuclear Non-Proliferation Treaty, Peter Revesz
A Game-Theoretic Analysis Of The Nuclear Non-Proliferation Treaty, Peter Revesz
CSE Conference and Workshop Papers
Although nuclear non-proliferation is an almost universal human desire, in practice, the negotiated treaties appear unable to prevent the steady growth of the number of states that have nuclear weapons. We propose a computational model for understanding the complex issues behind nuclear arms negotiations, the motivations of various states to enter a nuclear weapons program and the ways to diffuse crisis situations.
Average Min-Sum Decoding Of Ldpc Codes, Nathan Axvig, Deanna Dreher, Katherine Morrison, Eric T. Psota, Lance C. Pérez, Judy L. Walker
Average Min-Sum Decoding Of Ldpc Codes, Nathan Axvig, Deanna Dreher, Katherine Morrison, Eric T. Psota, Lance C. Pérez, Judy L. Walker
Department of Mathematics: Faculty Publications
Simulations have shown that the outputs of minsum (MS) decoding generally behave in one of two ways: the output either eventually stabilizes at a codeword or eventually cycles through a finite set of vectors that may include both codewords and non-codewords. This inconsistency in MS across iterations has significantly contributed to the difficulty in studying the performance of this decoder. To overcome this problem, a new decoder, average min-sum (AMS), is proposed; this decoder outputs the average of the min-sum output vectors over a finite set of iterations. Simulations comparing MS, AMS, linear programming (LP) decoding, and maximum likelihood (ML) …
A Universal Theory Of Pseudocodewords, Nathan Axvig, Emily Price, Eric T. Psota, Deanna Turk, Lance C. Pérez, Judy L. Walker
A Universal Theory Of Pseudocodewords, Nathan Axvig, Emily Price, Eric T. Psota, Deanna Turk, Lance C. Pérez, Judy L. Walker
Department of Mathematics: Faculty Publications
Three types of pseudocodewords for LDPC codes are found in the literature: graph cover pseudocodewords, linear programming pseudocodewords, and computation tree pseudocodewords. In this paper we first review these three notions and known connections between them. We then propose a new decoding rule — universal cover decoding — for LDPC codes. This new decoding rule also has a notion of pseudocodeword attached, and this fourth notion provides a framework in which we can better understand the other three.