Title: ANALYSIS OF METHODS OF CONSTRUCTION AND ENCODING LOW-DENSITY PARITY CHECK CODES
Abstract: 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.