Results 231 to 240 of about 395,210 (259)

Analog decoding of product codes

Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494), 2002
A design approach is presented for soft-decision decoding of block product codes ("block turbo codes") using analog computation with MOS devices. Application of analog decoding to large code sizes is also considered with the introduction of serial analog interfaces and pipeline schedules.
Chris Winstead, Chris J. Myers, Christian Schlegel, Reid R. Harrison   +3 more
openaire   +1 more source

Concatenated codes, matrix-product codes and their schur product [PDF]

, 2021
The aim of thesis is two-fold. Firstly, we introduce concatenated codes, matrixproduct codes and elaborate on their relation. It is known that a matrix-product code can be seen as a concatenated code. We give a proof of this fact. Conversely, we show how a particular concatenated code can be viewed as a matrix-product code.
openaire  

On products of graphs for LDPC codes

Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674), 2004
The notion of product block codes, whose generator matrix is the tensor product of the constituent generator matrices, is well established. Typically, they have good performance and a decoding algorithm with complexity on the order of the complexity of the decoding algorithms of the constituent codes.
Jun Xu 0004, Shu Lin 0001, Ian F. Blake
openaire   +2 more sources

Further results on product codes

IEEE Transactions on Information Theory, 1970
A new class of codes, called product generator codes, which are similar to Elias's iterated codes, are investigated. An important subclass of these codes is the generalized Reed-Muller codes. If the original codes that are iterated to produce a product code are L_1 and L_2 -step orthogonalizable, then the product code is ( L_1 + L_2 - 1 )-step ...
openaire   +3 more sources

Nonlinear Codes: The Product Construction

IEEE Transactions on Communications, 2007
The standard product construction is discussed with respect to nonlinear codes. Thus, so-called nonlinear product codes are obtained that are better than linear product codes of similar length and code rate, and at the same time, amenable for encoding/decoding.
openaire   +2 more sources

On quantum SPC product codes

Quantum Information Processing, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Product codes and the singleton bound

1994
Minimum distance is not always the most determinant factor to acheive high performance for error correction. Of course the knowledge of the whole weight distribution of the code is more accurate than the knowledge of the mere minimum distance, and the phenomenon amplifies for a high noise level.
openaire   +1 more source

Hardware Design of a Turbo Product Code Decoder

Lecture Notes in Electrical Engineering, 2021
Karthi Balasubramanian, Balasubramanian Karthi, B Yamuna   +2 more
exaly  

Blind Estimation of Code Parameters for Product Codes Over Noisy Channel Conditions

IEEE Transactions on Aerospace and Electronic Systems, 2020
Swaminathan R, As Madhukumar
exaly  

Design of High-Speed Turbo Product Code Decoder

Lecture Notes in Electrical Engineering, 2021
Karthi Balasubramanian, Yamuna B, B Yamuna   +2 more
exaly