Results 11 to 20 of about 143,981 (279)
Parity-Check Matrix Calculation for Paraunitary Oversampled DFT Filter Banks [PDF]
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
Symbol-level iterative information set decoding of RS codes
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
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
Moderate-density parity-check codes from projective bundles [PDF]
New constructions for moderate-density parity-check (MDPC) codes using finite geometry are proposed. We design a parity-check matrix for the main family of binary codes as the concatenation of two matrices: the incidence matrix between points and lines ...
Jessica Bariffi +3 more
semanticscholar +1 more source
A New Method for Building Low-Density-Parity-Check Codes
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]
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
Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes [PDF]
Linear programming (LP) decoding approximates maximum-likelihood (ML) decoding of a linear block code by relaxing the equivalent ML integer programming (IP) problem into a more easily solved LP problem.
Siegel, Paul H., Zhang, Xiaojie
core +1 more source
Blockwise and Low Density Key Error Correcting Codes [PDF]
To protect the information from disturbances created by noisy channels, redundant symbols (called check symbols) with the information symbols are added. These extra symbols play important role for the efficiency of the communication system.
Pankaj Kumar Das, Subodh Kumar
doaj +1 more source
Coding theory has started with the intention of detection and correction of errors which have occurred during communication. Different types of errors are produced by different types of communication channels and accordingly codes are developed to deal ...
Das P. K.
doaj +1 more source
On the Stopping Distance of SA-LDPC Codes by Transversal Designs
In this paper, we analyze the size of the smallest stopping set (called the stopping distance) for the parity-check matrix of a superposed array low-density parity-check (SA-LDPC) code for column weights 3 and 4 by using the transversal design (TD ...
Zahra Ferdosi +2 more
doaj +1 more source

