Author: Ivana DjurdjevicPublisher:
ISBN:
Category :
Languages : en
Pages : 320
Book Description
Algebraic and Combinatorial Constructions of Low-density Parity-check Codes
Author: Ivana DjurdjevicConstruction of Structured Low-density Parity-check Codes
Author: Lei ChenAlgebraic Constructions of Low-density Parity Check Codes
Author: Matthew T. KoetzAlgebraic Low-density Parity-check Codes
Author: Qiuju DiaoPublisher:
ISBN: 9781303442414
Category :
Languages : en
Pages :
Book Description
The ever-growing needs for cheaper, faster, and more reliable communication systems have forced many researchers to seek means to attain the ultimate limits on reliable communications. Low densityparity-check (LDPC) codes are currently the most promising coding technique to achieve the Shannon capacities for a wide range of channels. Many LDPC codes have been chosen as the standard codes for various next generations of communication systems and they are appearing in recent data storage products. More applications are expected to come.Major methods for constructing LDPC codes can be divided into two general categories, graphtheoretic-based methods (using computer search) and algebraic methods. Each type of constructions has its advantages and disadvantages in terms overall error performance, encoding and decoding implementations. In general, algebraically constructed LDPC codes have lower error-floor and their decoding using iterative message-passing algorithms converges at a much faster rate than the LDPC codes constructed using a graph theoretic-based method. Furthermore, it is much easier to constructalgebraic LDPC codes with large minimum distances.This research project is set up to investigate several important aspects of algebraic LDPC codes for the purpose of achieving overall good error performance required for future high-speed communication systems and high-density data storage systems. The subjects to be investigated include: (1) new constructions of algebraic LDPC codes based on finite geometries; (2) analysis of structural properties of algebraic LDPC codes, especially the trapping set structure that determines how lowthe error probability of a given LDPC code can achieve; (3) construction of algebraic LDPC codes and design coding techniques for correcting combinations of random errors and erasures that occursimultaneously in many physical communication and storage channels; and (4) analysis and construction of algebraic LDPC codes in transform domain.Research effort has resulted in important findings in all four proposed research subjects which may have a significant impact on future generations of communication and storage systems andadvance the state-of-the-art of channel coding theory.
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Author: Marc FossorierPublisher: Springer
ISBN: 3540448284
Category : Mathematics
Languages : en
Pages : 275
Book Description
This book constitutes the refereed proceedings of the 15th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-15, held in Toulouse, France, in May 2003.The 25 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 40 submissions. Among the subjects addressed are block codes; algebra and codes: rings, fields, and AG codes; cryptography; sequences; decoding algorithms; and algebra: constructions in algebra, Galois groups, differential algebra, and polynomials.
Error-Correction Coding and Decoding
Author: Martin TomlinsonPublisher: Springer
ISBN: 3319511033
Category : Technology & Engineering
Languages : en
Pages : 527
Book Description
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.
Algebraic Geometry Modeling in Information Theory
Author: Edgar Martinez-MoroPublisher: World Scientific
ISBN: 9814335754
Category : Computers
Languages : en
Pages : 334
Book Description
Algebraic & geometry methods have constituted a basic background and tool for people working on classic block coding theory and cryptography. Nowadays, new paradigms on coding theory and cryptography have arisen such as: Network coding, S-Boxes, APN Functions, Steganography and decoding by linear programming. Again understanding the underlying procedure and symmetry of these topics needs a whole bunch of non trivial knowledge of algebra and geometry that will be used to both, evaluate those methods and search for new codes and cryptographic applications. This book shows those methods in a self-contained form.
Low Density Parity Check Codes Based on Finite Geometries
Author: National Aeronautics and Space Adm NasaPublisher:
ISBN: 9781723736247
Category :
Languages : en
Pages : 36
Book Description
Low density parity check (LDPC) codes with iterative decoding based on belief propagation achieve astonishing error performance close to Shannon limit. No algebraic or geometric method for constructing these codes has been reported and they are largely generated by computer search. As a result, encoding of long LDPC codes is in general very complex. This paper presents two classes of high rate LDPC codes whose constructions are based on finite Euclidean and projective geometries, respectively. These classes of codes a.re cyclic and have good constraint parameters and minimum distances. Cyclic structure adows the use of linear feedback shift registers for encoding. These finite geometry LDPC codes achieve very good error performance with either soft-decision iterative decoding based on belief propagation or Gallager's hard-decision bit flipping algorithm. These codes can be punctured or extended to obtain other good LDPC codes. A generalization of these codes is also presented.Kou, Yu and Lin, Shu and Fossorier, MarcGoddard Space Flight CenterEUCLIDEAN GEOMETRY; ALGORITHMS; DECODING; PARITY; ALGEBRA; INFORMATION THEORY; PROJECTIVE GEOMETRY; TWO DIMENSIONAL MODELS; COMPUTERIZED SIMULATION; ERRORS; BLOCK DIAGRAMS...
LDPC Code Designs, Constructions, and Unification
Author: Juane LiPublisher: Cambridge University Press
ISBN: 1107175682
Category : Computers
Languages : en
Pages : 259
Book Description
In this book, leading authorities unify algebraic- and graph-based LDPC code designs and constructions into a single theoretical framework.
Algebraic and Stochastic Coding Theory
Author: Dave K. KythePublisher: CRC Press
ISBN: 1466505621
Category : Computers
Languages : en
Pages : 507
Book Description
Using a simple yet rigorous approach, Algebraic and Stochastic Coding Theory makes the subject of coding theory easy to understand for readers with a thorough knowledge of digital arithmetic, Boolean and modern algebra, and probability theory. It explains the underlying principles of coding theory and offers a clear, detailed description of each code. More advanced readers will appreciate its coverage of recent developments in coding theory and stochastic processes. After a brief review of coding history and Boolean algebra, the book introduces linear codes, including Hamming and Golay codes. It then examines codes based on the Galois field theory as well as their application in BCH and especially the Reed–Solomon codes that have been used for error correction of data transmissions in space missions. The major outlook in coding theory seems to be geared toward stochastic processes, and this book takes a bold step in this direction. As research focuses on error correction and recovery of erasures, the book discusses belief propagation and distributions. It examines the low-density parity-check and erasure codes that have opened up new approaches to improve wide-area network data transmission. It also describes modern codes, such as the Luby transform and Raptor codes, that are enabling new directions in high-speed transmission of very large data to multiple users. This robust, self-contained text fully explains coding problems, illustrating them with more than 200 examples. Combining theory and computational techniques, it will appeal not only to students but also to industry professionals, researchers, and academics in areas such as coding theory and signal and image processing.