Results 41 to 50 of about 177,188 (278)
On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes [PDF]
IEEE Transactions on Information Theory, 2013 To appear in IEEE Transactions of Information ...
Beelen, Peter +3 more
openaire +3 more sources
List Decoding Algorithm based on Voting in Groebner Bases for General One-Point AG Codes [PDF]
, 2016 We generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya Cab curves proposed by Lee, Bras-Amor\'os and O'Sullivan (2012) to general one-point AG codes, without any assumption. We also extend their unique decoding algorithm
Adams +55 more
core +3 more sources
A Low-Complexity Ordered Statistics Decoding Algorithm for Short Polar Codes
Applied Sciences, 2019 In this paper, we propose a low-complexity ordered statistics decoding (OSD) algorithm called threshold-based OSD (TH-OSD) that uses a threshold on the discrepancy of the candidate codewords to speed up the decoding of short polar codes. To determine the
Yusheng Xing, Guofang Tu
doaj +1 more source
Low-Complexity Joint Channel Estimation and List Decoding of Short Codes [PDF]
, 2019 A pilot-assisted transmission (PAT) scheme is proposed for short blocklengths, where the pilots are used only to derive an initial channel estimate for the list construction step.
Coşkun, Mustafa Cemil +3 more
core +2 more sources
Joint Source-Channel Decoding of Polar Codes for Language-Based Source
, 2016 We exploit the redundancy of the language-based source to help polar decoding. By judging the validity of decoded words in the decoded sequence with the help of a dictionary, the polar list decoder constantly detects erroneous paths after every few bits ...
Bandic, Zvonimir +4 more
core +1 more source
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Simplified polar code decoding algorithm
Dianzi Jishu Yingyong, 2018 Polar code is an error correction coding technique, which can prove from the mathematical point of view to reach Shannon′s limit. However, the traditional decoding algorithm, such as the successive cancellation(SC) and the successive cancellation list ...
Wang Dan +3 more
doaj +1 more source
Generalizations of Fano’s Inequality for Conditional Information Measures via Majorization Theory
Entropy, 2020 Fano’s inequality is one of the most elementary, ubiquitous, and important tools in information theory. Using majorization theory, Fano’s inequality is generalized to a broad class of information measures, which contains those of Shannon and ...
Yuta Sakai
doaj +1 more source
A Low-Complexity Sorting Network for a Fast List Polar Decoder
IEEE Access, 2023 Fast list decoding algorithms for polar codes have been proposed to achieve low latency and high error correction performance. In the Rate-1 and SPC nodes of fast list decoding, a high-complexity sorter is required if multiple bits are to be decoded ...
Yongje Lee +3 more
doaj +1 more source
List and Probabilistic Unique Decoding of Folded Subspace Codes
, 2015 A new class of folded subspace codes for noncoherent network coding is presented. The codes can correct insertions and deletions beyond the unique decoding radius for any code rate $R\in[0,1]$. An efficient interpolation-based decoding algorithm for this
Bartz, Hannes, Sidorenko, Vladimir
core +1 more source