Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A NEW CONSTRUCTION METHOD FOR LOW-DENSITY PARITY-CHECK CODES

Mahmoud Rashidpour, Javad Haghighat, Jamali S.H.R., H Behrouzi

Published Jan 1, 2003• 0 citations
OpenAlex

Related papers

A NEW FAMILY OF LOW-DENSITY PARITY CHECK CODES WITH LARGE GIRTH AND LOW COMPLEXITY

Xu Xia, Yanping Li, Moon Ho Lee

한국통신학회 학술대회 및 강연회•Apr 1, 2004•0 citations

ENCODING LOW-DENSITY PARITY-CHECK CODES

Tom Richardson, Rudiger L. Urbanke

Cambridge University Press eBooks•Mar 17, 2008•3 citations

PERFORMANCE OF PSEUDO-RANDOM AND QUASI-CYCLIC LOW DENSITY PARITY CHECK CODES

Onur Hüsnü Kazanci

•Jan 1, 2007•1 citation

A construction of low-density parity-check codes

李铁楠, 单秀玲

•Jan 1, 2013•2 citations

On construction of low density parity check codes

Bahram Honary, Shu Lin, E.M. Gabidulin +4 more

•Jun 2, 2004•21 citations

ANALYSIS OF METHODS OF CONSTRUCTION AND ENCODING LOW-DENSITY PARITY CHECK CODES

Alexey Stanyslavovych Volkov, Stanislav Sergeevich Zhuchenko

The article analyzes the famous methods of construction and representations of the check matrix block and convolutional codes with low-density parity-check. The analysis the famous methods of coding block and convolutional codes with low-density parity-check. Showed advantages and disadvantages of the known methods and allowed to identify and formulate a scientific and technical challenge. Shows the method of representation of the check matrix block codes with low-density parity-check using the Tanner graph, which like the check matrix is fully defines the parameters of the code. Check matrix of convolutional codes with low-density parity-check can also be described by Tanner graph, however, because the check matrix is infinite, then the Tanner graph is infinite. The analysis method of constructing the parity check matrix of block codes with low-density parity-check, which is based on a shortened Reed-Solomon code. Codes constructed in this method have a Tanner graph girth at least 6, which allows them to effectively use iterative decoding methods.

Collected scientific works of Ukrainian State University of Railway Transport•Dec 22, 2014•0 citations
The article analyzes the famous methods of construction and representations of the check matrix block and convolutional codes with low-density parity-check. The analysis the famous methods of coding block and convolutional codes with low-density parity-check. Showed advantages and disadvantages of the known methods and allowed to identify and formulate a scientific and technical challenge. Shows the method of representation of the check matrix block codes with low-density parity-check using the Tanner graph, which like the check matrix is fully defines the parameters of the code. Check matrix of convolutional codes with low-density parity-check can also be described by Tanner graph, however, because the check matrix is infinite, then the Tanner graph is infinite. The analysis method of constructing the parity check matrix of block codes with low-density parity-check, which is based on a shortened Reed-Solomon code. Codes constructed in this method have a Tanner graph girth at least 6, which allows them to effectively use iterative decoding methods.