Algebraic and Combinatorial Constructions of Low-density Parity-check Codes
Author: Ivana Djurdjevic
Publisher:
Published: 2003
Total Pages: 320
ISBN-13:
DOWNLOAD EBOOKPosts
Construction of Structured Low-density Parity-check Codes
Author: Lei Chen
Publisher:
Published: 2005
Total Pages: 340
ISBN-13:
DOWNLOAD EBOOKAlgebraic Constructions of Low-density Parity Check Codes
Author: Matthew T. Koetz
Publisher:
Published: 2005
Total Pages: 126
ISBN-13:
DOWNLOAD EBOOKApplied Algebra, Algebraic Algorithms and Error-Correcting Codes
Author: Marc Fossorier
Publisher: Springer
Published: 2003-08-03
Total Pages: 275
ISBN-13: 3540448284
DOWNLOAD EBOOKThis 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.
Algebraic Low-density Parity-check Codes
Author: Qiuju Diao
Publisher:
Published: 2013
Total Pages:
ISBN-13: 9781303442414
DOWNLOAD EBOOKThe 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.
Error-Correction Coding and Decoding
Author: Martin Tomlinson
Publisher: Springer
Published: 2017-02-21
Total Pages: 527
ISBN-13: 3319511033
DOWNLOAD EBOOKThis 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.
Low Density Parity Check Codes Based on Finite Geometries
Author: National Aeronautics and Space Adm Nasa
Publisher:
Published: 2018-09-15
Total Pages: 36
ISBN-13: 9781723736247
DOWNLOAD EBOOKLow 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...
Algebraic and Stochastic Coding Theory
Author: Dave K. Kythe
Publisher: CRC Press
Published: 2017-07-28
Total Pages: 507
ISBN-13: 1466505621
DOWNLOAD EBOOKUsing 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.
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Author: Marc Fossorier
Publisher: Springer Science & Business Media
Published: 2006-02-03
Total Pages: 348
ISBN-13: 3540314237
DOWNLOAD EBOOKThis book constitutes the refereed proceedings of the 16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16, held in Las Vegas, NV, USA in February 2006. The 25 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 32 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.
Some Algebraic Problems from Coding Theory
Author: Ogul Arslan
Publisher:
Published: 2009
Total Pages:
ISBN-13:
DOWNLOAD EBOOKABSTRACT: Let F be a finite field of size q and characteristic p. A low density parity check (LDPC) code is a finite dimensional subspace of a vector space over F.A parity check matrix of an LDPC code is a binary sparse matrix which is orthogonal to the code. In this work, we describe a family of LDPC codes called the LU(3,q) codes over F . Let M (P, L) be the point-line incidence matrix of the symplectic generalized quadrangle. We give a description of a submatrix H of M(P, L) such that, any LU(3,q) code has either H or the transpose of H as its parity check matrix. Previously, Peter Sin and Qing Xiang derived a formula for the dimension of the LU(3,q) codes for the case where F has an odd characteristic. If F has an even characteristic, the field of the geometry and the parity check matrix have the same characteristic, hence the solution requires di®erent techniques. In this research, we give a descriptions of the points and lines of the symplectic generalized quadrangle using characteristic functions and polynomials. Using representation theory of the symplectic group SP(4,q), we find a basis for the column space of M(P, L). We use this result to show that the 2-rank of H is rank22(M(P;L)) ¡ 2q. Hence, the dimension of an LU(3,2 [superscript t]) code is q3 + 2q ¡ rank2(M(P; L)). This completes the dimension problem for the LU(3,q) codes.
