Related references
Note: Only part of the references are listed.
Article
Engineering, Electrical & Electronic
Kirill Ivanov et al.
Summary: The recently introduced polar codes are a breakthrough in coding theory due to their capacity-achieving property, but the decoding complexity is high. This paper explores the factors affecting the decoding complexity by studying the group of symmetries of the codes and permutation decoding algorithms.
IEEE TRANSACTIONS ON COMMUNICATIONS
(2022)
Article
Engineering, Electrical & Electronic
Mikhail Kamenev
Summary: In this paper, a novel iterative decoding algorithm for Reed-Muller (RM) codes is presented, which utilizes a graph representation of the code. The algorithm uses a greedy local search to find a node optimizing a metric and incorporates a cyclic redundancy check to improve the computational complexity. Simulation results show that the presented decoder achieves performance close to maximum likelihood decoding for RM codes and outperforms state-of-the-art decoding algorithms for a wide range of block lengths and rates.
IEEE TRANSACTIONS ON COMMUNICATIONS
(2022)
Article
Engineering, Electrical & Electronic
Marvin Geiselhart et al.
Summary: RM codes are known for their good maximum likelihood performance in the short block-length regime, but finding a low complexity soft-input decoding scheme remains an open problem. We have presented a versatile decoding architecture for RM codes based on their rich automorphism group, which can be seen as a generalization of multiple-bases belief propagation.
IEEE TRANSACTIONS ON COMMUNICATIONS
(2021)
Article
Engineering, Electrical & Electronic
Andreas Buchberger et al.
Summary: This research focuses on near maximum-likelihood (ML) decoding of short linear block codes, proposing a novel decoding approach based on neural belief propagation (NBP) with pruning for significant performance improvements and reduced complexity. Experimental results show that the pruning method leads to noticeable performance gains compared to conventional methods, under a specific complexity level.
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
(2021)
Article
Computer Science, Information Systems
Emmanuel Abbe et al.
Summary: RM codes are one of the oldest and simplest codes in coding theory, which are still under investigation for their important properties. Recent developments have been made in the weight enumerator, capacity-achieving properties, and algorithmic improvements for RM codes. The paper discusses connections between RM codes, thresholds of Boolean functions, polarization theory, hypercontractivity, and techniques for approximating low weight codewords using lower degree polynomials.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2021)
Proceedings Paper
Computer Science, Information Systems
Peihong Yuan et al.
Summary: The proposed complexity-adaptive tree search algorithm is suitable for G(N)-coset codes, achieving near-ML decoding without the need for an outer code to terminate decoding. It can be applied to various code constructions and does not require optimization of a separate parameter like sequential decoders do.
2021 IEEE INFORMATION THEORY WORKSHOP (ITW)
(2021)
Proceedings Paper
Computer Science, Theory & Methods
Mikhail Kamenev
Summary: A soft-input sequential decoder is proposed for RM codes of specific lengths and orders, achieving near maximum-likelihood decoding performance with reasonable complexity. This algorithm outperforms the recursive list decoder with similar computational complexity.
2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
(2021)
Proceedings Paper
Computer Science, Theory & Methods
Dorsa Fathollahi et al.
Summary: The paper presents a new algorithm that reduces the computational budget of Reed-Muller codes' decoder by using sparse projection aggregation, while maintaining performance close to that of the RPA decoder. The method reduces the RPA decoder's computations by up to 80% with negligible performance loss.
2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
(2021)
Article
Computer Science, Information Systems
Min Ye et al.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2020)
Proceedings Paper
Automation & Control Systems
Fabrizio Carpi et al.
2019 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON)
(2019)
Article
Computer Science, Information Systems
I Dumer et al.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2006)
Article
Computer Science, Information Systems
I Dumer
IEEE TRANSACTIONS ON INFORMATION THEORY
(2004)
Article
Computer Science, Information Systems
A Ashikhmin et al.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2004)
