Results 41 to 50 of about 178,221 (275)
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
A Reduced Latency List Decoding Algorithm for Polar Codes
, 2014 Long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm.
Lin, Jun, Xiong, Chenrong, Yan, Zhiyuan
core +1 more source
List Decodable Subspace Recovery
CoRR, 2020 Learning from data in the presence of outliers is a fundamental problem in statistics. In this work, we study robust statistics in the presence of overwhelming outliers for the fundamental problem of subspace recovery. Given a dataset where an $α$ fraction (less than half) of the data is distributed uniformly in an unknown $k$ dimensional subspace in ...
Prasad Raghavendra, Morris Yau
openaire +3 more sources
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
Bounds on List Decoding of Rank-Metric Codes [PDF]
, 2012 So far, there is no polynomial-time list decoding algorithm (beyond half the minimum distance) for Gabidulin codes. These codes can be seen as the rank-metric equivalent of Reed--Solomon codes.
Wachter-Zeh, Antonia
core +2 more sources
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
IEEE Access, 2022 Polar codes are one of the most recent additions to the family of forward error correction (FEC) codes, having recently been adopted in the 5G New Radio (NR) standard for the control channel.
Oualid Mouhoubi +2 more
doaj +1 more source
Linear-algebraic list decoding of folded Reed-Solomon codes [PDF]
, 2011 Folded Reed-Solomon codes are an explicit family of codes that achieve the optimal trade-off between rate and error-correction capability: specifically, for any $\eps > 0$, the author and Rudra (2006,08) presented an $n^{O(1/\eps)}$ time algorithm to ...
Guruswami, Venkatesan
core +2 more sources
Pre-Configured Error Pattern Ordered Statistics Decoding for CRC-Polar Codes
Entropy, 2023 In this paper, we propose a pre-configured error pattern ordered statistics decoding (PEPOSD) algorithm and discuss its application to short cyclic redundancy check (CRC)-polar codes.
Xuanyu Li +5 more
doaj +1 more source