%0 Journal Article %1 geiselhart2022automorphism %A Geiselhart, Marvin %A Ebada, Moustafa %A Elkelesh, Ahmed %A Clausius, Jannis %A Brink, Stephan ten %D 2022 %I IEEE %J IEEE communications letters %K %N 8 %P 1705-1709 %R 10.1109/LCOMM.2022.3174164 %T Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries %V 26

@article{geiselhart2022automorphism, added-at = {2023-08-31T16:27:16.000+0200}, affiliation = {Geiselhart, M (Corresponding Author), Univ Stuttgart, Inst Telecommun, D-70569 Stuttgart, Germany. Geiselhart, Marvin; Ebada, Moustafa; Elkelesh, Ahmed; Clausius, Jannis; ten Brink, Stephan, Univ Stuttgart, Inst Telecommun, D-70569 Stuttgart, Germany.}, author = {Geiselhart, Marvin and Ebada, Moustafa and Elkelesh, Ahmed and Clausius, Jannis and Brink, Stephan ten}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/23495a51a2c3def840aba9db228c32d5f/puma-wartung}, doi = {10.1109/LCOMM.2022.3174164}, interhash = {3cbcfaf98e5d33099a4e3f29c5bd2180}, intrahash = {3495a51a2c3def840aba9db228c32d5f}, issn = {{1089-7798} and {1558-2558}}, journal = {IEEE communications letters}, keywords = {}, language = {eng}, number = 8, pages = {1705-1709}, publisher = {IEEE}, research-areas = {Telecommunications}, timestamp = {2023-08-31T14:27:16.000+0200}, title = {Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries}, unique-id = {WOS:000841808700004}, volume = 26, year = 2022 }