Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephan ten Brink
- > Home > Persons > Stephan ten Brink
Publications
- 2022
[j31]Marvin Geiselhart
, Moustafa Ebada, Ahmed Elkelesh, Jannis Clausius, Stephan ten Brink:
Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries. IEEE Commun. Lett. 26(8): 1705-1709 (2022)- [c98]Marvin Geiselhart, Andreas Zunker, Ahmed Elkelesh, Jannis Clausius, Stephan ten Brink:
Graph Search based Polar Code Design. IEEECONF 2022: 387-391 - [c93]Marvin Geiselhart, Ahmed Elkelesh, Jannis Clausius, Fei Liang, Wen Xu, Jing Liang, Stephan ten Brink:
Learning Quantization in LDPC Decoders. GLOBECOM (Workshops) 2022: 467-472 - [c91]Marvin Geiselhart, Ahmed Elkelesh, Jannis Clausius, Stephan ten Brink:
A Polar Subcode Approach to Belief Propagation List Decoding. ITW 2022: 243-248 - [i69]Marvin Geiselhart, Moustafa Ebada, Ahmed Elkelesh, Jannis Clausius, Stephan ten Brink:
Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries. CoRR abs/2202.00287 (2022) - [i67]Marvin Geiselhart, Ahmed Elkelesh, Jannis Clausius, Stephan ten Brink:
A Polar Subcode Approach to Belief Propagation List Decoding. CoRR abs/2205.06631 (2022) - [i61]Marvin Geiselhart, Ahmed Elkelesh, Jannis Clausius, Fei Liang, Wen Xu, Jing Liang, Stephan ten Brink:
Learning Quantization in LDPC Decoders. CoRR abs/2208.05186 (2022) - [i59]Marvin Geiselhart, Andreas Zunker, Ahmed Elkelesh, Jannis Clausius, Stephan ten Brink:
Graph Search based Polar Code Design. CoRR abs/2211.16010 (2022) - 2021
- [j30]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Automorphism Ensemble Decoding of Reed-Muller Codes. IEEE Trans. Commun. 69(10): 6424-6438 (2021) - [c84]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
On the Automorphism Group of Polar Codes. ISIT 2021: 1230-1235 - [c82]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Iterative Reed-Muller Decoding. ISTC 2021: 1-5 - [i57]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
On the Automorphism Group of Polar Codes. CoRR abs/2101.09679 (2021) - [i53]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Iterative Reed-Muller Decoding. CoRR abs/2107.12613 (2021) - 2020
- [c77]Moustafa Ebada, Sebastian Cammerer, Ahmed Elkelesh, Marvin Geiselhart, Stephan ten Brink:
Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels. ACSSC 2020: 683-688 - [c76]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
CRC-Aided Belief Propagation List Decoding of Polar Codes. ISIT 2020: 395-400 - [c74]Ahmed Elkelesh, Sebastian Cammerer, Stephan ten Brink:
Reducing Polar Decoding Latency by Neural Network-Based On-the-Fly Decoder Selection. SiPS 2020: 1-2 - [i51]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
CRC-Aided Belief Propagation List Decoding of Polar Codes. CoRR abs/2001.05303 (2020) - [i46]Moustafa Ebada, Sebastian Cammerer, Ahmed Elkelesh, Marvin Geiselhart, Stephan ten Brink:
Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels. CoRR abs/2012.01075 (2020) - [i45]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Automorphism Ensemble Decoding of Reed-Muller Codes. CoRR abs/2012.07635 (2020) - 2019
- [j24]Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Laurent Schmalen, Stephan ten Brink:
Decoder-in-the-Loop: Genetic Optimization- Based LDPC Code Design. IEEE Access 7: 141161-141170 (2019) - [j23]Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Decoder-Tailored Polar Code Design Using the Genetic Algorithm. IEEE Trans. Commun. 67(7): 4521-4534 (2019) - [c67]Moustafa Ebada, Sebastian Cammerer, Ahmed Elkelesh, Stephan ten Brink:
Deep Learning-Based Polar Code Design. Allerton 2019: 177-183 - [c63]Moustafa Ebada, Ahmed Elkelesh, Stephan ten Brink:
Optimizing Polar Codes Compatible with Off-the-Shelf LDPC Decoders. ITW 2019: 1-5 - [i42]Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Genetic Algorithm-based Polar Code Construction for the AWGN Channel. CoRR abs/1901.06444 (2019) - [i41]Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Decoder-tailored Polar Code Design Using the Genetic Algorithm. CoRR abs/1901.10464 (2019) - [i40]Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Decoder-in-the-Loop: Genetic Optimization-based LDPC Code Design. CoRR abs/1903.03128 (2019) - [i34]Moustafa Ebada, Ahmed Elkelesh, Stephan ten Brink:
Optimizing Polar Codes Compatible with Off-the-Shelf LDPC Decoders. CoRR abs/1909.12030 (2019) - [i33]Moustafa Ebada, Sebastian Cammerer, Ahmed Elkelesh, Stephan ten Brink:
Deep Learning-based Polar Code Design. CoRR abs/1909.12035 (2019) - 2018
- [j18]Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Belief Propagation List Decoding of Polar Codes. IEEE Commun. Lett. 22(8): 1536-1539 (2018) - [c57]Moustafa Ebada, Ahmed Elkelesh, Sebastian Cammerer, Stephan ten Brink:
Scattered EXIT Charts for Finite Length LDPC Code Design. ICC 2018: 1-7 - [c56]Sebastian Cammerer, Moustafa Ebada, Ahmed Elkelesh, Stephan ten Brink:
Sparse Graphs for Belief Propagation Decoding of Polar Codes. ISIT 2018: 1465-1469 - [c49]Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Belief propagation decoding of polar codes on permuted factor graphs. WCNC 2018: 1-6 - [i31]Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Belief Propagation Decoding of Polar Codes on Permuted Factor Graphs. CoRR abs/1801.04299 (2018) - [i25]Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Belief Propagation List Decoding of Polar Codes. CoRR abs/1806.10503 (2018) - 2017
- [c37]Ahmed Elkelesh, Sebastian Cammerer, Moustafa Ebada, Stephan ten Brink:
Mitigating clipping effects on error floors under belief propagation decoding of polar codes. ISWCS 2017: 384-389 - [i12]Moustafa Ebada, Ahmed Elkelesh, Sebastian Cammerer, Stephan ten Brink:
Scattered EXIT Charts for Finite Length LDPC Code Design. CoRR abs/1706.09239 (2017) - [i10]Ahmed Elkelesh, Sebastian Cammerer, Moustafa Ebada, Stephan ten Brink:
Mitigating Clipping Effects on Error Floors under Belief Propagation Decoding of Polar Codes. CoRR abs/1711.05572 (2017) - [i9]Sebastian Cammerer, Moustafa Ebada, Ahmed Elkelesh, Stephan ten Brink:
Sparse Graphs for Belief Propagation Decoding of Polar Codes. CoRR abs/1712.08538 (2017) - 2016
- [c30]Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Improving Belief Propagation decoding of polar codes using scattered EXIT charts. ITW 2016: 91-95 - [i7]Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Improving Belief Propagation Decoding of Polar Codes Using Scattered EXIT Charts. CoRR abs/1611.03655 (2016) - [i6]Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Flexible Length Polar Codes through Graph Based Augmentation. CoRR abs/1611.03796 (2016)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
