Demonetization came as a bolt from the blue to every Indian on 8/11/2016. Most people were hurt financially, while Arjun, Nisha and Sunny saw their world tumbling down before them. Left with no other option but to combat against it, they decided to stand by each other to confront the emotionally catastrophic situation together. While the nation was struggling to get in terms with the unprecedented economic turmoil, they had other social evils to stand up against as well.

How can one exchange information e?ectively when the medium of com- nication introduces errors? This question has been investigated extensively starting with the seminal works of Shannon (1948) and Hamming (1950), and has led to the rich theory of “error-correcting codes”. This theory has traditionally gone hand in hand with the algorithmic theory of “decoding” that tackles the problem of recovering from the errors e?ciently. This thesis presents some spectacular new results in the area of decoding algorithms for error-correctingcodes. Speci?cally,itshowshowthenotionof“list-decoding” can be applied to recover from far more errors, for a wide variety of err- correcting codes, than achievable before. A brief bit of background: error-correcting codes are combinatorial str- tures that show how to represent (or “encode”) information so that it is - silient to a moderate number of errors. Speci?cally, an error-correcting code takes a short binary string, called the message, and shows how to transform it into a longer binary string, called the codeword, so that if a small number of bits of the codewordare ?ipped, the resulting string does not look like any other codeword. The maximum number of errorsthat the code is guaranteed to detect, denoted d, is a central parameter in its design. A basic property of such a code is that if the number of errors that occur is known to be smaller than d/2, the message is determined uniquely. This poses a computational problem,calledthedecodingproblem:computethemessagefromacorrupted codeword, when the number of errors is less than d/2.

This book discusses both the theory and practical applications of self-correcting data, commonly known as error-correcting codes. The applications included demonstrate the importance of these codes in a wide range of everyday technologies, from smartphones to secure communications and transactions. Written in a readily understandable style, the book presents the authors’ twenty-five years of research organized into five parts: Part I is concerned with the theoretical performance attainable by using error correcting codes to achieve communications efficiency in digital communications systems. Part II explores the construction of error-correcting codes and explains the different families of codes and how they are designed. Techniques are described for producing the very best codes. Part III addresses the analysis of low-density parity-check (LDPC) codes, primarily to calculate their stopping sets and low-weight codeword spectrum which determines the performance of th ese codes. Part IV deals with decoders designed to realize optimum performance. Part V describes applications which include combined error correction and detection, public key cryptography using Goppa codes, correcting errors in passwords and watermarking. This book is a valuable resource for anyone interested in error-correcting codes and their applications, ranging from non-experts to professionals at the forefront of research in their field. This book is open access under a CC BY 4.0 license.

There are eight chapters, useful appendix and solved question papers in the book. Basic digital communication, line codes and sampling methods are presented at the beginning. Digital pulse modulation techniques such as PCM, DPCM, DM, ADM are presented. Continuous wave digital modulation methods such as BPSK, DPSK, QPSK, QAM, BFSK and OOK are presented with mathematical analysis of modulators and receivers. Issues related to baseband transmission such as ISI, Nyquist pulse shaping criterian, optimum reception, matched filter and eye patterns are also discussed. Concepts of information theory such as discrete memoryless channels, mutual information, shannon's theorems on source coding are also presented. Coding using linear block codes, cyclic codes and convolutional coding is also discussed. Secured communication using spread spectrum modulation is also discussed in detail.

This book gives a detailed overview of a universal Maximum Likelihood (ML) decoding technique, known as Guessing Random Additive Noise Decoding (GRAND), has been introduced for short-length and high-rate linear block codes. The interest in short channel codes and the corresponding ML decoding algorithms has recently been reignited in both industry and academia due to emergence of applications with strict reliability and ultra-low latency requirements . A few of these applications include Machine-to-Machine (M2M) communication, augmented and virtual Reality, Intelligent Transportation Systems (ITS), the Internet of Things (IoTs), and Ultra-Reliable and Low Latency Communications (URLLC), which is an important use case for the 5G-NR standard. GRAND features both soft-input and hard-input variants. Moreover, there are traditional GRAND variants that can be used with any communication channel, and specialized GRAND variants that are developed for a specific communication channel. This book presents a detailed overview of these GRAND variants and their hardware architectures. The book is structured into four parts. Part 1 introduces linear block codes and the GRAND algorithm. Part 2 discusses the hardware architecture for traditional GRAND variants that can be applied to any underlying communication channel. Part 3 describes the hardware architectures for specialized GRAND variants developed for specific communication channels. Lastly, Part 4 provides an overview of recently proposed GRAND variants and their unique applications. This book is ideal for researchers or engineers looking to implement high-throughput and energy-efficient hardware for GRAND, as well as seasoned academics and graduate students interested in the topic of VLSI hardware architectures. Additionally, it can serve as reading material in graduate courses covering modern error correcting codes and Maximum Likelihood decoding for short codes.

Will the real Antichrist please stand up? For the last two thousand years people have been anxiously trying to analyze who the Antichrist might be and when he might be revealed. Many people have made preposterous claims, and of course, they have been wrong. If you're not careful, you can get caught up in the debate and spend so much time arguing with other Christians over the details that you don't accomplish anything for the kingdom! To make matters worse, we now live in an era when, for the first time, we have the possibility of an artificial intelligence Antichrist, a human computer hybrid that will demand to be worshipped. Have you ever wondered if it's OK to have Alexa, Siri, and other forms of artificial intelligence in your home? We know that the Bible says great deception is coming, so what is a concerned believer to do? Author and minister Mark Biltz wants you to understand the methods of the Antichrist so you won't be deceived. This book will help you know the big picture of what has happened historically, what is unfolding this very moment, and what the future holds concerning the Antichrist based on the unfolding purposes of God.

It is a great pleasure to be asked to write the Preface for this book on trellis decoding of error correcting block codes. The subject is extremely significant both theoretically and practically, and is very timely because of recent devel opments in the microelectronic implementation and range of application of error-control coding systems based on block codes. The authors have been notably active in signal processing and coding research and development for several years, and therefore very well placed to contribute to the state of the art on the subject of trellis decoding. In particular, the book represents a unique approach to many practical aspects of the topic. As the authors point out, there are two main classes of error control codes: block codes and convolutinal codes. Block codes came first historically and have a well-developed mathematical structure. Convolutional codes come later, and have developed heuristically, though a more formal treatment has emerged via recent developments in the theory of symbolic dynamics. Max imum likelihood (ML) decoding of powerful codes in both these classes is computationally complex in the general case; that is, ML decoding fails into the class of NP-hard computational problems. This arieses because the de coding complexity is an exponential function of key parameters of the code.

As the demand for data reliability increases, coding for error control becomes increasingly important in data transmission systems and has become an integral part of almost all data communication system designs. In recent years, various trellis-based soft-decoding algorithms for linear block codes have been devised. New ideas developed in the study of trellis structure of block codes can be used for improving decoding and analyzing the trellis complexity of convolutional codes. These recent developments provide practicing communication engineers with more choices when designing error control systems. Trellises and Trellis-based Decoding Algorithms for Linear Block Codes combines trellises and trellis-based decoding algorithms for linear codes together in a simple and unified form. The approach is to explain the material in an easily understood manner with minimal mathematical rigor. Trellises and Trellis-based Decoding Algorithms for Linear Block Codes is intended for practicing communication engineers who want to have a fast grasp and understanding of the subject. Only material considered essential and useful for practical applications is included. This book can also be used as a text for advanced courses on the subject.