default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Hug
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[b1]Florian Hug:
Codes on Graphs and More. Lund University, Sweden, 2012- [j6]Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
Dual convolutional codes and the MacWilliams identities. Probl. Inf. Transm. 48(1): 21-30 (2012) - [j5]Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov, Roman V. Satyukov:
Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth. IEEE Trans. Inf. Theory 58(4): 2265-2279 (2012) - [j4]Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
A Closed-Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes. IEEE Trans. Inf. Theory 58(7): 4635-4644 (2012) - [c10]Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
A greedy search for improved QC LDPC codes with good girth profile and degree distribution. ISIT 2012: 3083-3087 - [c9]Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
High-rate QC LDPC codes of short and moderate length with good girth profile. ISTC 2012: 150-154 - 2011
- [j3]Daniel Johnsson, Fredrik Bjärkeson, Martin Hell
, Florian Hug:
Searching for New Convolutional Codes using the Cell Broadband Engine Architecture. IEEE Commun. Lett. 15(5): 560-562 (2011) - [j2]Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
Woven convolutional graph codes with large free distances. Probl. Inf. Transm. 47(1): 1-14 (2011) - [c8]Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov, Roman V. Satyukov:
Some voltage graph-based LDPC tailbiting codes with large girth. ISIT 2011: 732-736 - [c7]Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
Double-Hamming based QC LDPC codes with large minimum distance. ISIT 2011: 923-927 - [c6]Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
On the exact bit error probability for Viterbi decoding of convolutional codes. ITA 2011: 217-222 - [i2]Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov, Roman V. Satyukov:
Searching for Voltage Graph-Based LDPC Tailbiting Codes with Large Girth. CoRR abs/1108.0840 (2011) - [i1]Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
An Analytic Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes. CoRR abs/1111.3820 (2011) - 2010
- [j1]Florian Hug, Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov:
A rate R = 5/20 hypergraph-based woven convolutional code with free distance 120. IEEE Trans. Inf. Theory 56(4): 1618-1623 (2010) - [c5]Florian Hug, Fredrik Rusek:
The BEAST for Maximum-Likelihood Detection in Non-Coherent MIMO Wireless Systems. ICC 2010: 1-5 - [c4]Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov, Roman V. Satyukov:
New low-density parity-check codes with large girth based on hypergraphs. ISIT 2010: 819-823 - [c3]Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
On weight enumerators and MacWilliams identity for convolutional codes. ITA 2010: 210-215
2000 – 2009
- 2009
- [c2]Florian Hug, Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov:
Searching for high-rate convolutional codes via binary syndrome trellises. ISIT 2009: 1358-1362 - 2008
- [c1]Axel Heim, Uli Sorger, Florian Hug:
Doppler-variant modeling of the vocal tract. ICASSP 2008: 4197-4200
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-24 22:47 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:
