Results 11 to 20 of about 50 (31)
Quasi-Optimal Path Convergence-Aided Automorphism Ensemble Decoding of Reed-Muller Codes. [PDF]
By 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.
Tian K, Sun H, Liu Y, Liu R.
europepmc +6 more sources
Low-Complexity Automorphism Ensemble Decoding of Reed-Muller Codes Using Path Pruning. [PDF]
The 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.
Tian K, Liu R, Lu Z.
europepmc +7 more sources
Automorphism Set Construction for Automorphism Ensemble Decoding With Reduced Delay
The 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 +4 more sources
Polar Codes for Automorphism Ensemble Decoding [PDF]
6 pages, 4 figures, final version of conference paper accepted to IEEE ITW ...
Charles Pillet +2 more
exaly +5 more sources
Automorphism Ensemble Decoding of Reed–Muller Codes [PDF]
Accepted for Publication in IEEE Transactions on ...
Marvin Geiselhart +2 more
exaly +3 more sources
Group Properties of Polar Codes for Automorphism Ensemble Decoding
submitted to IEEE for possible ...
Valerio Bioglio +2 more
exaly +4 more sources
On the Distribution of Partially-Symmetric Codes for Automorphism Ensemble Decoding
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
exaly +3 more sources
Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries
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 +2 more
exaly +3 more sources
Rate-Compatible Polar Codes for Automorphism Ensemble Decoding
5 pages, 2 figures, submitted to IEEE for possible ...
Marvin Geiselhart, Stephan Ten Brink
exaly +3 more sources
Shortened Polar Codes Under Automorphism Ensemble Decoding
5 pages, 4 figures, accepted in IEEE Communications ...
Charles Pillet +2 more
exaly +4 more sources

