Results 271 to 280 of about 8,529,401 (324)
Analog decoding of product codes [PDF]
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 +3 more
core +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Generalized tensor product codes
IEEE Transactions on Information Theory, 1981A class of binary error-correcting codes, called generalized tensor product codes, is presented with their decoding algorithm. These codes are constructed by combining a number of codes on various extension fields with shorter binary codes. A general algorithm is provided to do bounded distance decoding for these codes.
Hideki Imai, Hiroshi Fujiya
exaly +3 more sources
Turbo Product Codes Based on Convolutional Codes [PDF]
In this article, we introduce a new class of product codes based on convolutional codes, called convolutional product codes. The structure of product codes enables parallel decoding, which can significantly increase decoder speed in practice.
Orhan Gazi, Ali Özgur Yilmaz
exaly +2 more sources
Three New Constructions of Optimal Locally Repairable Codes From Matrix-Product Codes
IEEE Transactions on Information Theory, 2023Locally repairable codes have become a key instrument in large-scale distributed storage systems. This paper focuses on the construction of locally repairable codes with $(r,\delta)$ -locality that achieve equality in the Singleton-type bound.
Gaojun Luo, M. F. Ezerman, S. Ling
semanticscholar +1 more source
Erasure-correction-enhanced iterative decoding for LDPC-RS product codes
China Communications, 2021Low-density parity-check (LDPC) codes are widely used due to their significant error-correction capability and linear decoding complexity. However, it is not sufficient for LDPC codes to satisfy the ultra low bit error rate (BER) requirement of next ...
Weigang Chen
exaly +2 more sources
New Families of MDS Symbol-Pair Codes From Matrix-Product Codes
IEEE Transactions on Information Theory, 2023In emerging storage technologies, the outputs of the channels consist of overlapping pairs of symbols. The errors are no longer individual symbols. Controlling them calls for a different approach. Symbol-pair codes have been proposed as a solution.
Gaojun Luo +3 more
semanticscholar +1 more source
ProductAE: Toward Training Larger Channel Codes based on Neural Product Codes
ICC 2022 - IEEE International Conference on Communications, 2021There have been significant research activities in recent years to automate the design of channel encoders and decoders via deep learning. Due the dimensionality challenge in channel coding, it is prohibitively complex to design and train relatively ...
Mohammad Vahid Jamali +3 more
semanticscholar +1 more source
Blind Estimation of Code Parameters for Product Codes Over Noisy Channel Conditions
Product codes are multidimensional codes constructed using multiple component codes. In this paper, novel algorithms are proposed for the blind estimation of two-dimensional product code parameters over the noisy channel conditions considering Reed ...
Swaminathan R +2 more
exaly +2 more sources
Linear and multilinear algebra, 2021
In this paper, we firstly present a new criterion of linear complementary pairs (abbreviated to LCP) of codes over finite fields. Our result for the linear complementary pairs of codes extends the criterion of linear complementary dual (LCD) codes given ...
Hualu Liu, Xiusheng Liu
semanticscholar +1 more source
In this paper, we firstly present a new criterion of linear complementary pairs (abbreviated to LCP) of codes over finite fields. Our result for the linear complementary pairs of codes extends the criterion of linear complementary dual (LCD) codes given ...
Hualu Liu, Xiusheng Liu
semanticscholar +1 more source
Product Codes and Parallel Concatenated Product Codes
2007 IEEE Wireless Communications and Networking Conference, 2007We study the decoding of product codes and a class of parallel concatenated product codes (PCPC). PCPC improves the minimum distance while retaining the merit of low decoding complexity of turbo product codes (TPC). We prove that using the Fibonacci interleaver does help increasing the minimum distance.
T. Din Hwa Huang +3 more
openaire +1 more source

