On LDPC Codes from (0, 1) -Geometries Induced by Finite Inversive Spaces of Even Order
نویسندگان
چکیده
Low Density Parity Check (LDPC) codes have enjoyed increasing interest during recent years. In general these are described in the terminology of sparse bipartite graphs containing no 4 -cycles, but an alternative way to deal with them are a particular class of incidence structures, namely partial linear spaces. This paper shows how to obtain a large class of partial linear spaces from inversive spaces and show via simulation that the induced LDPC codes have good error-correcting performance.
منابع مشابه
Galois geometries and coding theory
Galois geometries and coding theory are two research areas which have been interacting with each other for many decades. From the early examples linking linear MDS codes with arcs in finite projective spaces, linear codes meeting the Griesmer bound with minihypers, covering radius with saturating sets, links have evolved to functional codes, generalized projective Reed–Muller codes, and even fu...
متن کاملLow Density Parity Check Codes Based on Finite Geometries: A Rediscovery and New Results1
This paper presents a geometric approach to the construction of low density parity check (LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of Euclidean and projective geometries over finite fields. Codes of these four classes have good minimum distances and their Tanner graphs have girth 6. Finite geometry LDPC codes can be decoded in various ways, ranging f...
متن کاملLow-density parity-check codes based on finite geometries: A rediscovery and new results
This paper presents a geometric approach to the construction of low-density parity-check (LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of Euclidean and projective geometries over finite fields. Codes of these four classes have good minimum distances and their Tanner graphs have girth 6. Finite-geometry LDPC codes can be decoded in various ways, ranging f...
متن کاملPerformance Analaysis of Low-Density Parity-Check Codes Derived from Finite Inversive Spaces
Low Density Parity Check (LDPC) codes have been the center of numerous researches in the last ten years. The reason for this interest is due to the performance (Error ratio over SNR) that these codes can achieve keeping the complexity of the pair coding/decoding to a level lower than other codes such as Turbo codes. This project aims to continue and intensify performance simulations on LDPC cod...
متن کاملLDPC codes from the Hermitian curve
Amongst the contributions to the theory of LDPC codes deriving from finite geometries ([13], [12], [9]), we present a study of the code C which has as parity-check matrix H the incidence matrix of the Hermitian curve of PG(2, q) and the q + 1-secant to it. The good performance of C with iterative decoding algorithm is showed by Johnson and Weller in [11]. In this paper we prove the ”double” cyc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007