Results 31 to 40 of about 178,221 (275)
Efficient list-decoding with constant alphabet and list sizes [PDF]
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021 We present an explicit and efficient algebraic construction of capacity-achieving list decodable codes with both constant alphabet and constant list sizes. More specifically, for any $R \in (0,1)$ and $ε>0$, we give an algebraic construction of an infinite family of error-correcting codes of rate $R$, over an alphabet of size $(1/ε)^{O(1/ε^2 ...
Zeyu Guo 0001, Noga Ron-Zewi
openaire +3 more sources
In Situ Multi-Bit Decision for Successive Cancellation List Decoding of Polar Codes
IEEE Access, 2022 Polar codes are the first capacity-achieving error-correction code which has attracted much research attention. Among many decoding methods, successive cancellation list decoding (SCLD) is considered as a representative decoding method that can achieve a
Jaehyeon Park +2 more
doaj +1 more source
Behavioral Models for List Decoding [PDF]
Mathematical and Computer Modelling of Dynamical Systems, 2002 Recently it has been shown that list decoding of Reed-Solomon codes may be translated into a bivariate interpolation problem. The data consist of pairs in a finite field and the aim is to find a bivariate polynomial that interpolates the given pairs and is minimal with respect to some criterion.
Kuijper, M., Polderman, Jan W.
openaire +2 more sources
On the List Decodability of Insertions and Deletions [PDF]
IEEE Transactions on Information Theory, 2018 In this work, we study the problem of list decoding of insertions and deletions. We present a Johnson-type upper bound on the maximum list size. The bound is meaningful only when insertions occur. Our bound implies that there are binary codes of rate $Ω(1)$ that are list-decodable from a $0.707$-fraction of insertions. For any $τ_\mathsf{I} \geq 0$ and
Tomohiro Hayashi, Kenji Yasunaga
openaire +3 more sources
An Improved Bit-Flipping Algorithm of Successive Cancellation List Decoding for Polar Codes
Mathematics, 2023 Polar codes, as the coding scheme for the control channel in fifth-generation mobile communication technology (5G), have attracted widespread attention since their proposal.
Desheng Wang +5 more
doaj +1 more source
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
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
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