Results 1 to 10 of about 279 (76)
Automorphism Set Construction for Automorphism Ensemble Decoding With Reduced Delay
IEEE Open Journal of the Communications SocietyThe anticipated demands of 6G ultra-reliable low-latency communications (URLLC) call for near-instantaneous data transfers and error-correction efficiency rivaling maximum-likelihood (ML) decoding. Achieving an effective compromise between latency, power
Anna Fominykh, Kirill Shabunov
doaj +2 more sources
Rate-Compatible Polar Codes for Automorphism Ensemble Decoding
2023 12th International Symposium on Topics in Coding (ISTC), 2023 5 pages, 2 figures, submitted to IEEE for possible ...
Geiselhart, Marvin +2 more
openaire +3 more sources
Shortened Polar Codes Under Automorphism Ensemble Decoding
IEEE Communications LettersIn this paper, we propose a low-latency decoding solution of shortened polar codes based on their automorphism groups. The automorphism group of shortened polar codes, designed according to two existing shortening patterns, are shown to be limited but non-empty, making the Automorphism Ensemble (AE) decoding of shortened polar codes possible. Extensive
Charles Pillet +3 more
openaire +4 more sources
Quasi-Optimal Path Convergence-Aided Automorphism Ensemble Decoding of Reed–Muller Codes
EntropyBy exploiting the rich automorphisms of Reed–Muller (RM) codes, the recently developed automorphism ensemble (AE) successive cancellation (SC) decoder achieves a near-maximum-likelihood (ML) performance for short block lengths.
Kairui Tian +3 more
doaj +3 more sources
Low-Complexity Automorphism Ensemble Decoding of Reed-Muller Codes Using Path Pruning
EntropyThe newly developed automorphism ensemble decoder (AED) leverages the rich automorphisms of Reed–Muller (RM) codes to achieve near maximum likelihood (ML) performance at short code lengths.
Kairui Tian, Rongke Liu, Zheng Lu
doaj +3 more sources
Automorphism Ensemble Decoding of Reed–Muller Codes [PDF]
IEEE Transactions on Communications, 2021 Accepted for Publication in IEEE Transactions on ...
Marvin Geiselhart +4 more
openaire +2 more sources
Polar Codes for Automorphism Ensemble Decoding [PDF]
2021 IEEE Information Theory Workshop (ITW), 2021 6 pages, 4 figures, final version of conference paper accepted to IEEE ITW ...
Pillet, C, Bioglio, V, Land, I
openaire +3 more sources
Group Properties of Polar Codes for Automorphism Ensemble Decoding
IEEE Transactions on Information Theory, 2023 submitted to IEEE for possible ...
Valerio Bioglio +2 more
openaire +3 more sources
On the Distribution of Partially-Symmetric Codes for Automorphism Ensemble Decoding
2023 IEEE Information Theory Workshop (ITW), 2023 Automorphism Ensemble (AE) decoding has recently drawn attention as a possible alternative to list decoding of polar codes. In this letter, we investigate the distribution of Partially-Symmetric Reed-Muller (PS-RM) codes, a family of polar codes yielding good performances under AE decoding.
Charles Pillet +2 more
openaire +2 more sources
Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries
IEEE Communications Letters, 2022 We consider automorphism ensemble decoding (AED) of quasi-cyclic (QC) low-density parity-check (LDPC) codes. Belief propagation (BP) decoding on the conventional factor graph is equivariant to the quasi-cyclic automorphisms and therefore prevents gains by AED.
Marvin Geiselhart +4 more
openaire +2 more sources