Results 1 to 10 of about 108,131 (252)
Ldpc Code Construction using Randomly Permutated Copies of Parity Check Matrix [PDF]
مجلة جامعة النجاح للأبحاث العلوم الطبيعية, 2018 A construction technique is proposed for low-density parity check (LDPC) codes. It uses a base parity check matrix designed from a ran-dom or constructed construction method as Gallager or Quasi-Cyclic LDPC (QC-LDPC) codes in sequence to get codes with ...
Amr lulu, Ammar Abu-Hudrouss
doaj +2 more sources
ON THE CLASS OF ARRAY-BASED APM-LDPC CODES [PDF]
Journal of Algebraic Systems, 2021 We construct an explicit class of affine permutation matrix low-density parity-check (APM-LDPC) codes based on the array parity-check matrix by using two affine maps f (x) = x-1 and g(x) = 2x-1 on Z_m, where m is an odd prime number, with girth 6 and ...
A. Nassaj, A. R. Naghipour
doaj +1 more source
An improved method for counting 6-cycles in low-density parity-check codes [PDF]
Serbian Journal of Electrical Engineering, 2023 Since their rediscovery in the early 1990s, low-density parity-check (LDPC) codes have become the most popular error-correcting codes owing to their excellent performance. An LDPC code is a linear block code that has a sparse parity-check matrix.
Slimani Djamel, Kaddai Abdellah
doaj +1 more source
Adaptive Audio Steganography Based on Improved Syndrome-Trellis Codes
IEEE Access, 2021 Syndrome-Trellis Code (STC) is a near-optimal convolutional method for adaptive steganography. Hitherto, the existing adaptive steganography commonly depends on the carefully designed distortion cost function, which controls the embedding position of the
Kaiyu Ying +3 more
doaj +1 more source
Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach [PDF]
IEEE Transactions on Information Theory, 2020 A $q$-ary $(n,k,r)$ locally repairable code (LRC) is an $[n,k,d]$ linear code over $\mathbb{F}_q$ such that every code symbol can be recovered by accessing at most $r$ other code symbols. The well-known Singleton-like bound says that $d \le n-k-\lceil k/r\rceil +2$ and an LRC is said to be optimal if it attains this bound.
Jie Hao +5 more
openaire +2 more sources
Symbol-level iterative information set decoding of RS codes
Alexandria Engineering Journal, 2023 This paper presents the implementation of a low-complex iterative symbol-level decoding scheme for Reed-Solomon codes. Most soft-decision iterative decoders for Reed-Solomon codes work on a bit level due to the efficient passing of soft information due ...
Yuval Genga +2 more
doaj +1 more source
Parity-Check Matrix Calculation for Paraunitary Oversampled DFT Filter Banks [PDF]
IEEE Transactions on Signal Processing, 2008 Oversampled filter banks, interpreted as error correction codes, were recently introduced in the literature. We here present an efficient calculation and implementation of the parity-check polynomial matrices for oversampled DFT filter banks. If desired, the calculation of the partity-check polynomials can be performed as part of the prototype filter ...
Karp, Tania +2 more
openaire +2 more sources
Entropy, 2023 In this article, a graph-theoretic method (taking advantage of constraints among sets associated with the corresponding parity-check matrices) is applied for the construction of a double low-density parity-check (D-LDPC) code (also known as LDPC code ...
Yijie Lv +3 more
doaj +1 more source
A New Method for Building Low-Density-Parity-Check Codes
International Journal of Technology, 2019 This paper proposes a new method for building low-density-parity-check codes, exempt of cycle of length 4, based on a circulant permutation matrix, which needs very little memory for storage it in the encoder and a dual diagonal structure is applied ...
Tehami Mohammed Amine, Djebbari Ali
doaj +1 more source
A Note on “A Systematic (12,8) Code for Correcting Single Errors and Detecting Adjacent Errors” [PDF]
, 1994 J.W. Schwartz and J.K. Wolf (ibid., vol. 39, no. 11, pp. 1403-1404, Nov. 1990) gave a parity check matrix for a systematic (12,8) binary code that corrects all single errors and detects eight of the nine double adjacent errors within any of the three 4 ...
Blaum, Mario +2 more
core +1 more source