Results 41 to 50 of about 640,896 (52)

Improved Automorphism Ensemble Decoder for Polar Codes

IEEE Communications Letters
In this work, we propose an improved automorphism ensemble (AE) decoder for polar codes. With successive cancellation (SC) variant automorphisms, multiple decoding paths in the AE decoder produce their estimates of the transmitted codeword.
Jeongseok Ha, Seokju Han
exaly   +3 more sources

Constituent Automorphism Decoding of Reed–Muller Codes [PDF]

IEEE Transactions on Communications
Automorphism-ensemble decoding is applied to the Plotkin constituents of Reed-Muller codes, resulting in a new soft-decision decoding algorithm with state-of-the-art performance versus complexity trade-offs.11 pages, 8 figures, 5 ...
Frank Kschischang, Amir Tasbihi
exaly   +3 more sources

Successive Cancellation Automorphism List Decoding of Polar Codes [PDF]

, 2023
The discovery of suitable automorphisms of polar codes gained a lot of attention by applying them in Automorphism Ensemble Decoding (AED) to improve the error-correction performance, especially for short block lengths.
Norbert Wehn, Stephan Ten Brink, Marvin Geiselhart   +2 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Automorphism Ensemble Decoding With Reduced Delay

2024 IEEE Globecom Workshops (GC Wkshps)
Anna Fominykh
exaly   +2 more sources

Automorphism Ensemble Decoding of Polar Codes With Reduced Number of Routes

2025 13th International Symposium on Topics in Coding (ISTC)
Huayi Zhou, Warren J Gross, Jiajie Li
exaly   +3 more sources

Automorphism Ensemble Decoding on GPU: Achieving High Throughput and Low Latency for Polar and RM Codes

IEEE Transactions on Signal Processing
Rongke Liu, Kairui Tian, Yansong Li
exaly   +2 more sources

Subcode Ensemble Decoding of Linear Block Codes [PDF]

Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime.
Jonathan Mandelbaum
exaly   +3 more sources

Improved Generalized Automorphism Belief Propagation Decoding [PDF]

With the increasing demands on future wireless systems, new design objectives become eminent. Low-density parity-check codes together with belief propagation (BP) decoding have outstanding performance for large block lengths.
Jonathan Mandelbaum
exaly   +3 more sources

Speeding Up Decoding a Code With a Non-Trivial Automorphism Group Up to an Exponential Factor

, 2019
International audienceWe give an algorithm that is able to speed up the decoding of a code with a non-trivial automorphism group, by summing for the word that has to be decoded, all its entries belonging to a same orbit and decoding the resulting word in
Jean-Pierre Tillich
exaly   +2 more sources