Results 11 to 20 of about 178,509 (285)
Applied Sciences, 2022 According to an in-depth analysis of the relationship among n-level polybinary transformation, the time-packing factor and the performance of the decoding algorithm, we find that the appropriate n-level polybinary transformation can improve the ...
Peng Sun +3 more
doaj +1 more source
List decoding of repeated codes [PDF]
, 2013 Assuming that we have a soft-decision list decoding algorithm of a linear code, a new hard-decision list decoding algorithm of its repeated code is proposed in this article. Although repeated codes are not used for encoding data, due to their parameters,
Hernando, Fernando +2 more
core +4 more sources
Decoding the Golay code with Venn diagrams [PDF]
, 1990 A decoding algorithm, based on Venn diagrams, for decoding the [23, 12, 7] Golay code is presented. The decoding algorithm is based on the design properties of the parity sets of the code. As for other decoding algorithms for the Golay code, decoding can
Blaum, Mario, Bruck, Jehoshua
core +2 more sources
A Low-latency Successive Cancellation List Decoding Algorithm for Polar Codes [PDF]
Jisuanji gongcheng, 2018 In order to further reduce the decoding delay,a low-latency adaptive Successive Cancellation List(SCL) decoding algorithm based on path reuse is proposed.A repeated path replicating scheme based on CRC check is adopted for the phenomenon that there is a ...
LIU Yajun,LI Shibao,LIU Jianhang,CHEN Haihua
doaj +1 more source
A latency‐reduced SC flip decoding algorithm for polar codes
IET Communications, 2022 The successive cancellation flip (SC Flip) decoding algorithm was recently suggested for decoding polar codes, which could improve the performance of the frame error rate (FER).
Dong Yang, Yinyou Mao, Xingcheng Liu
doaj +1 more source
Low-Complexity LP Decoding of Nonbinary Linear Codes [PDF]
, 2013 Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. LP decoding has been derived for binary and nonbinary linear codes.
Mark F. Flanagan +5 more
core +1 more source
Successive Cancellation Decoding of Single Parity-Check Product Codes [PDF]
, 2017 We introduce successive cancellation (SC) decoding of product codes (PCs) with single parity-check (SPC) component codes. Recursive formulas are derived, which resemble the SC decoding algorithm of polar codes. We analyze the error probability of SPC-PCs
Amat, Alexandre Graell i +3 more
core +2 more sources
Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding [PDF]
, 2019 We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric.
Amat, Alexandre Graell i +2 more
core +3 more sources
Binary Systematic Network Coding for Progressive Packet Decoding [PDF]
, 2015 We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show that systematic
Chatzigeorgiou, Ioannis +2 more
core +3 more sources
Degenerate Viterbi decoding [PDF]
, 2012 We present a decoding algorithm for quantum convolutional codes that finds the class of degenerate errors with the largest probability conditioned on a given error syndrome. The algorithm runs in time linear with the number of qubits.
Pelchat, Emilie, Poulin, David
core +1 more source