Results 21 to 30 of about 19,174 (291)

Aspects of List-of-Two Decoding

open access: yes, 2006
We study the problem of list decoding with focus on the case when we have a list size limited to two. Under this restriction we derive general lower bounds on the maximum possible size of a list-of-2-decodable code.
Eriksson, Jonas
core   +3 more sources

Restart Mechanisms for the Successive-Cancellation List-Flip Decoding of Polar Codes [PDF]

open access: yesEntropy
Polar codes concatenated with a cyclic redundancy check (CRC) code have been selected in the 5G standard with the successive-cancellation list (SCL) of list size L = 8 as the baseline algorithm.
Charles Pillet   +3 more
doaj   +2 more sources

Bidirectional stack decoding of polar codes [PDF]

open access: yesVojnotehnički Glasnik, 2021
Introduction/purpose: The paper introduces a reduced latency stack decoding algorithm of polar codes, inspired by the bidirectional stack decoding of convolutional codes and based on the folding technique.
Aleksandar Đ. Minja   +2 more
doaj   +1 more source

Fast Successive-Cancellation List Flip Decoding of Polar Codes

open access: yesIEEE Access, 2022
This work presents a fast successive-cancellation list flip (Fast-SCLF) decoding algorithm for polar codes that addresses the high latency issue associated with the successive-cancellation list flip (SCLF) decoding algorithm.
Nghia Doan   +2 more
doaj   +1 more source

Secure codes with list decoding

open access: yes2022 IEEE International Symposium on Information Theory (ISIT), 2022
20 ...
Yujie Gu, Ilya Vorobyev, Ying Miao 0001
openaire   +2 more sources

Fast list decoders for polarization‐adjusted convolutional (PAC) codes

open access: yesIET Communications, 2023
A latest coding scheme named polarization‐adjusted convolutional (PAC) codes is shown to approach the dispersion bound for the code (128,64) under list decoding.
Hongfei Zhu   +4 more
doaj   +1 more source

List-decodable covariance estimation

open access: yesProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022
Abstract slightly clipped.
Misha Ivkov, Pravesh K. Kothari
openaire   +2 more sources

Large-Small Sorting for Successive Cancellation List Decoding of Polar Codes

open access: yesIEEE Access, 2020
The successive cancellation list (SCL) decoding is used to achieve good error-correcting performance for practical finite-length polar codes. However, the metric sorting that is repeatedly performed in SCL decoding increases the overall decoding latency ...
Kyungpil Lee, In-Cheol Park
doaj   +1 more source

List Decoding with Double Samplers [PDF]

open access: yesSIAM Journal on Computing, 2019
We strengthen the notion of "double samplers", first introduced by Dinur and Kaufman [Proc. 58th FOCS, 2017], which are samplers with additional combinatorial properties, and whose existence we prove using high dimensional expanders. The ABNNR code construction [IEEE Trans. Inform.
Irit Dinur   +4 more
openaire   +5 more sources

List decoding of polar codes [PDF]

open access: yes2011 IEEE International Symposium on Information Theory Proceedings, 2011
We describe a successive-cancellation \emph{list} decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Arıkan. In the proposed list decoder, up to $L$ decoding paths are considered concurrently at each decoding stage. Then, a single codeword is selected from the list as output. If the most likely codeword
Ido Tal, Alexander Vardy
openaire   +2 more sources

Home - About - Disclaimer - Privacy