Results 231 to 240 of about 143,981 (279)
Some of the next articles are maybe not open access.
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
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
International Symposium on Information Theory
In this paper, we propose an efficient method to reduce error floors in quantum error correction using non-binary low-density parity-check (LDPC) codes.
Kenta Kasai
semanticscholar +1 more source
In this paper, we propose an efficient method to reduce error floors in quantum error correction using non-binary low-density parity-check (LDPC) codes.
Kenta Kasai
semanticscholar +1 more source
On Parity-Check Matrices of Twisted Generalized Reed–Solomon Codes
IEEE Transactions on Information TheoryTwisted Generalized Reed-Solomon (TGRS) Codes are a class of linear codes which contain MDS codes but are not equivalent to GRS code. In recent years, many scholars have studied the construction of MDS self-dual codes through TGRS code. Among these works,
Weidong Cheng
semanticscholar +1 more source
On Construction of Low-Density Parity-Check Codes for Ultra-Reliable and Low Latency Communications
IEEE Transactions on CommunicationsLow-density parity-check (LDPC) codes with protograph-based raptor-like (PBRL) structure have been chosen as the data channel coding scheme for the fifth-generation (5G) enhanced mobile broad band (eMBB) services.
Linqi Zou +5 more
semanticscholar +1 more source
VLSI Design for High-Speed Sparse Parity-Check Matrix Decoders
Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005., 2006In this paper, the design of high-speed iterative decoders for sparse parity-check matrix (SPCM) codes such as LDPC, repeat-accumulate and turbo-like codes is addressed. The random nature of the underlying Tanner graph associated with these codes is problematic for a high-speed decoder implementation.
openaire +1 more source
Using a Single Parity-Check to Reduce the Guesswork of Guessing Codeword Decoding
Annual Conference on Information Sciences and SystemsGuessing Codeword Decoding (GCD) is a recently proposed soft-input forward error correction decoder for arbitrary binary linear codes. Inspired by recent proposals that leverage binary linear codebook structure to reduce the number of queries made by ...
Joseph Griffin +3 more
semanticscholar +1 more source
Decreasing error floor in LDPC codes by parity-check matrix extensions
2009 IEEE International Symposium on Information Theory, 2009High error floors in optimized irregular LDPC codes limit their usage in applications that require low error rates. We introduce new methods for lowering the error floor of LDPC codes, based on enhancing the code's parity-check matrix with additional linearly dependent and independent parity-checks. We prove NP hardness of certain optimization problems
Omer Fainzilber +2 more
openaire +1 more source