Results 201 to 210 of about 108,131 (252)
Some of the next articles are maybe not open access.
On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
SIAM Journal on Discrete Mathematics, 2015The coin weighing problem asks to find \(m\) counterfeit coins (those with different weight) among \(n\) coins. The reconstructing graph from additive queries problem asks to reconstruct a graph \(G\), which is an unknown weighted graph with \(n\) vertices and at most \(m\) edges, from certain information.
Bshouty, Nader H., Mazzawi, Hanna
openaire +1 more source
The Q-matrix Low-Density Parity-Check codes
Journal of Electronics (China), 2006This paper presents a matrix permuting approach to the construction of Low-Density Parity-Check (LDPC) code. It investigates the structure of the sparse parity-check matrix defined by Gallager. It is discovered that the problem of constructing the sparse parity-check matrix requires an algorithm that is efficient in search environments and also is able
Li Peng, Guangxi Zhu
openaire +1 more source
14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003., 2004
In this paper, we consider the design of simple irregular low-density parity-check (LDPC) codes with semi-random parity-check matrix for good performance and fast encoding in practical applications with finite-length. We limit the number of degree-two variable nodes to satisfy the semi-random construction and then we optimize a simple irregular ...
M. Rashidpour, S.H. Jamali
openaire +1 more source
In this paper, we consider the design of simple irregular low-density parity-check (LDPC) codes with semi-random parity-check matrix for good performance and fast encoding in practical applications with finite-length. We limit the number of degree-two variable nodes to satisfy the semi-random construction and then we optimize a simple irregular ...
M. Rashidpour, S.H. Jamali
openaire +1 more source
Parity check matrix construction via Magic Square Based Algorithm
2012 International Symposium on Communications and Information Technologies (ISCIT), 2012This paper presents a construction algorithm for the short block irregular LDPC codes. By applying a magic square theorem as a part of the matrix construction, a newly developed algorithm, the so-called Magic Square Based Algorithm (MSBA), is obtained.
Chutima Prasartkaew, Somsak Choomchuay
openaire +1 more source
Matrix Transposition Based Cryptographic Code With Two Dimensional Parity Checking
Proceedings of the Second International Conference on Information and Communication Technology for Competitive Strategies, 2016The amount of data is increasing tremendously. With the upgraded technology the use of raw data as a sharing particle through various networks has becoming a part of the business procedure. Therefore one business organization has to incorporate the proper constraints on data and should implement a proper security algorithm that will be useful to ...
Bidisha Mandal +2 more
openaire +1 more source
Multi-modal Adaptive Steganography Algorithm with Variable Parity Check Matrix
2018 IEEE 4th International Conference on Computer and Communications (ICCC), 2018At present, steganography has a wide range of problems such that the user has lower participation in the steganography process and it's difficult to ensure the security of the steganography algorithm. This is the main cause that steganography cannot go out of laboratory to become practical.
Haitao Song +3 more
openaire +1 more source
A design of parity check matrix for Irregular LDPC codes
2009 9th International Symposium on Communications and Information Technology, 2009This paper outlines a work on a design of parity check matrix for Irregular LDPC codes. The design is based on the adjustment of the modified array LDPC codes and interleave-modified array LDPC codes. The code rate of 0.930 is obtained. LDPC Codes based on this design suits the short and medium block length.
Chutima Prasartkaew, Somsak Choomchuay
openaire +1 more source
Time-varying periodic convolutional codes with low-density parity-check matrix
IEEE Transactions on Information Theory, 1999Summary: We present a class of convolutional codes defined by a low-density parity-check matrix and an iterative algorithm of the decoding of these codes. The performance of this decoding is close to the performance of turbo decoding. Our simulation shows that for the rate \(R= 1/2\) binary codes, the performance is substantially better than for ...
Jiménez Felström, Alberto +1 more
openaire +2 more sources
The Minimal Product Parity Check Matrix and Its Application
2006 IEEE International Conference on Communications, 2006In decoding a linear block code C by iterative decoding algorithms, these algorithms are essentially applied on a graphical representation of C such as Tanner graph and factor graph. Due to the impact of the structure of these graphs on the performance of code, we consider minimal parity check matrices(matrices with minimum number of nonzero entries ...
openaire +1 more source
Relation Between Parity-Check Matrixes and Cycles of Associated Tanner Graphs
IEEE Communications Letters, 2007This correspondence presents an approach to the representation of cycles of Tanner graphs on associated parity-check matrices. Several equivalent conditions for the girth of a Tanner graph to be 2k are proposed. An algorithm to determine girth of associated Tanner graphs of parity-check matrices is proposed, also with an algorithm to count shortest ...
Ruwei Chen, Huawei Huang, Guozhen Xiao
openaire +1 more source