Остановите войну!
for scientists:
default search action
Stefan Ländner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [b1]Stefan Ländner:
Improving the Error-Floor Behavior of Low-Density Parity-Check Codes. University of Erlangen-Nuremberg, 2011 - 2010
- [j5]Thorsten Hehn, Johannes B. Huber, Olgica Milenkovic, Stefan Laendner:
Multiple-bases belief-propagation decoding of high-density cyclic codes. IEEE Trans. Commun. 58(1): 1-8 (2010)
2000 – 2009
- 2009
- [j4]Stefan Laendner, Thorsten Hehn, Olgica Milenkovic, Johannes B. Huber:
The Trapping Redundancy of Linear Block Codes. IEEE Trans. Inf. Theory 55(1): 53-63 (2009) - [i5]Thorsten Hehn, Johannes B. Huber, Olgica Milenkovic, Stefan Laendner:
Multiple-Bases Belief-Propagation Decoding of High-Density Cyclic Codes. CoRR abs/0905.0079 (2009) - 2008
- [j3]Thorsten Hehn, Olgica Milenkovic, Stefan Laendner, Johannes B. Huber:
Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes. IEEE Trans. Inf. Theory 54(12): 5308-5331 (2008) - [i4]Thorsten Hehn, Johannes B. Huber, Stefan Laendner:
MBBP for improved iterative channel decoding in 802.16e WiMAX systems. CoRR abs/0809.1348 (2008) - 2007
- [j2]Stefan Laendner, Olgica Milenkovic:
LDPC Codes Based on Latin Squares: Cycle Structure, Stopping Set, and Trapping Set Analysis. IEEE Trans. Commun. 55(2): 303-312 (2007) - [j1]Vijay Nagarajan, Stefan Laendner, Nikhil Jayakumar, Olgica Milenkovic, Sunil P. Khatri:
High-throughput VLSI Implementations of Iterative Decoders and Related Code Construction Problems. J. VLSI Signal Process. 49(1): 185-206 (2007) - [c4]Thorsten Hehn, Johannes B. Huber, Stefan Laendner, Olgica Milenkovic:
Multiple-Bases Belief-Propagation for Decoding of Short Block Codes. ISIT 2007: 311-315 - [c3]Thorsten Hehn, Olgica Milenkovic, Stefan Laendner, Johannes B. Huber:
Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block Codes. ISIT 2007: 2926-2930 - [i3]Thorsten Hehn, Olgica Milenkovic, Stefan Laendner, Johannes B. Huber:
Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes. CoRR abs/0708.0905 (2007) - [i2]Stefan Laendner, Thorsten Hehn, Olgica Milenkovic, Johannes B. Huber:
Two Methods for Reducing the Error-Floor of LDPC Codes. CoRR abs/cs/0701006 (2007) - [i1]Thorsten Hehn, Olgica Milenkovic, Stefan Laendner, Johannes B. Huber:
Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block Codes. CoRR abs/cs/0702050 (2007) - 2006
- [c2]Stefan Laendner, Thorsten Hehn, Olgica Milenkovic, Johannes B. Huber:
When Does One Redundant Parity-Check Equation Matter? GLOBECOM 2006 - 2004
- [c1]Olgica Milenkovic, Stefan Laendner:
Analysis of the cycle-structure of LDPC codes based on Latin squares. ICC 2004: 777-781
Coauthor Index
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 01:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint