default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRolf Johannesson
Person information
- affiliation: Lund University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2016
[j52]Irina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson:
Searching for Binary and Nonbinary Block and Convolutional LDPC Codes. IEEE Trans. Inf. Theory 62(1): 163-183 (2016)- 2014
- [c23]Irina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson:
LDPC convolutional codes versus QC LDPC block codes in communication standard scenarios. ISIT 2014: 2774-2778 - [c22]Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov:
A unified approach to optimization of LDPC codes for various communication scenarios. ISTC 2014: 243-248 - 2013
- [c21]Irina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson:
Combinatorial optimization for improving QC LDPC codes performance. ISIT 2013: 2651-2655 - [c20]Irina E. Bocharova, Boris D. Kudryashov, Nikolay I. Makarov, Rolf Johannesson:
Near maximum-likelihood decoding of Generalized LDPC and woven graph codes. ISIT 2013: 3005-3009 - 2012
- [j51]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) - [j50]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) - [j49]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) - [c19]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 - [c18]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
- [j48]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) - [c17]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 - [c16]Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
Double-Hamming based QC LDPC codes with large minimum distance. ISIT 2011: 923-927 - [c15]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 - [i3]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) - [i2]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
- [j47]Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov, Victor V. Zyablov
:
Woven graph codes: asymptotic performances and examples. IEEE Trans. Inf. Theory 56(1): 121-129 (2010) - [j46]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) - [c14]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 - [c13]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
- [j45]Victor V. Zyablov, Rolf Johannesson, Maja Loncar:
Low-complexity error correction of Hamming-code-based LDPC codes. Probl. Inf. Transm. 45(2): 95-109 (2009) - [c12]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
- [j44]Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov, Maja Loncar:
An Improved Bound on the List Error Probability and List Distance Properties. IEEE Trans. Inf. Theory 54(1): 13-32 (2008) - [j43]Maja Loncar, Rolf Johannesson, Irina E. Bocharova, Boris D. Kudryashov:
Soft-Output BEAST Decoding With Application to Product Codes. IEEE Trans. Inf. Theory 54(3): 1036-1049 (2008) - [c11]Irina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson, Victor V. Zyablov:
Asymptotic performances of woven graph codes. ISIT 2008: 1025-1029 - [i1]Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov, Victor V. Zyablov:
Woven Graph Codes: Asymptotic Performances and Examples. CoRR abs/0804.0996 (2008) - 2007
- [j42]Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov:
Trellis Complexity of Short Linear Codes. IEEE Trans. Inf. Theory 53(1): 361-368 (2007) - [c10]Maja Loncar, Rolf Johannesson, Irina E. Bocharova, Boris D. Kudryashov:
A Comparison of Some Trellis- and Tree-Based SISO Algorithms for Decoding and Equalization. ISIT 2007: 1696-1700 - [c9]Irina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson, Victor V. Zyablov:
Asymptotically Good Woven Codes with Fixed Constituent Convolutional Codes. ISIT 2007: 2326-2330 - 2006
- [j41]Victor A. Pavlushkov, Rolf Johannesson, Victor V. Zyablov:
Unequal error protection for convolutional codes. IEEE Trans. Inf. Theory 52(2): 700-708 (2006) - [c8]Irina E. Bocharova, Boris D. Kudryashov, Maja Loncar, Rolf Johannesson:
An Improved Bound on the List Error Probability and List Distance Properties. ISIT 2006: 719-723 - [c7]Maja Loncar, Rolf Johannesson, Jossy Sayir, Irina E. Bocharova, Boris D. Kudryashov:
On Suboptimum Component Decoding for Product Codes. ISIT 2006: 2240-2244 - 2005
- [j40]Irina E. Bocharova, Marc Handlery, Rolf Johannesson, Boris D. Kudryashov:
BEAST decoding of block codes obtained via convolutional codes. IEEE Trans. Inf. Theory 51(5): 1880-1891 (2005) - [c6]Maja Loncar, Rolf Johannesson, Irina E. Bocharova, Boris D. Kudryashov:
Estimating the list size for BEAST-APP decoding. ISIT 2005: 1126-1130 - [c5]Victor A. Pavlushkov, Rolf Johannesson, Victor V. Zyablov:
Unequal error protection explained by state-transition graphs. ISIT 2005: 2236-2240 - [c4]Irina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson:
BEAST decoding - asymptotic complexity. ITW 2005: 11-15 - 2004
- [j39]Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov, Maja Loncar:
BEAST decoding for block codes. Eur. Trans. Telecommun. 15(4): 297-305 (2004) - [j38]Victor V. Zyablov, Rolf Johannesson, Victor A. Pavlushkov:
Detecting and Correcting Capabilities of Convolutional Codes. Probl. Inf. Transm. 40(3): 187-194 (2004) - [j37]Ralph Jordan, Rolf Johannesson, Martin Bossert:
On nested convolutional codes and their application to woven codes. IEEE Trans. Inf. Theory 50(2): 380-384 (2004) - [j36]Irina E. Bocharova, Marc Handlery, Rolf Johannesson, Boris D. Kudryashov:
A BEAST for Prowling in Trees. IEEE Trans. Inf. Theory 50(6): 1295-1302 (2004) - [j35]Marc Handlery, Rolf Johannesson, Victor V. Zyablov:
On Error Exponents for Woven Convolutional Codes With One Tailbiting Component Code. IEEE Trans. Inf. Theory 50(8): 1809-1811 (2004) - [j34]Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov:
Low State Complexity Block Codes Via Convolutional Codes. IEEE Trans. Inf. Theory 50(9): 2022-2030 (2004) - [j33]Ralph Jordan, Stefan Höst, Rolf Johannesson, Martin Bossert, Victor V. Zyablov:
Woven convolutional codes. II: decoding aspects. IEEE Trans. Inf. Theory 50(10): 2522-2531 (2004) - [c3]Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov, Maja Loncar:
On APP-decoding using BEAST. ISIT 2004: 344 - [c2]Sabine Ertl, Rolf Johannesson, Victor A. Pavlushkov:
A new look at the error-correcting capabilities of convolutional codes. ISIT 2004: 406 - [c1]Victor A. Pavlushkov, Rolf Johannesson, Victor V. Zyablov:
On unequal error protection for information symbols via active distances. ISIT 2004: 452 - 2003
- [j32]Marc Handlery, Rolf Johannesson, Victor V. Zyablov:
Boosting the error performance of suboptimal tailbiting decoders. IEEE Trans. Commun. 51(9): 1485-1491 (2003) - 2002
- [j31]Marc Handlery, Rolf Johannesson, Victor V. Zyablov:
Encoder and Distance Properties of Woven Convolutional Codes with One Tailbiting Component Code. Probl. Inf. Transm. 38(1): 41-49 (2002) - [j30]Per Ståhl, Rolf Johannesson:
A Note on Systematic Tailbiting Encoders. Probl. Inf. Transm. 38(1): 55-64 (2002) - [j29]Marc Handlery, Rolf Johannesson, Victor V. Zyablov:
Distance Approach to Window Decoding. Probl. Inf. Transm. 38(3): 169-181 (2002) - [j28]Marc Handlery, Stefan Höst, Rolf Johannesson, Victor V. Zyablov:
A Distance Measure Tailored to Tailbiting Codes. Probl. Inf. Transm. 38(4): 280-295 (2002) - [j27]Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov, Per Ståhl:
Tailbiting codes: Bounds and search results. IEEE Trans. Inf. Theory 48(1): 137-148 (2002) - [j26]Stefan Höst, Rolf Johannesson, Victor V. Zyablov:
Woven convolutional codes I: Encoder properties. IEEE Trans. Inf. Theory 48(1): 149-161 (2002) - [j25]Per Ståhl, John B. Anderson, Rolf Johannesson:
A note on tailbiting codes and their feedback encoders. IEEE Trans. Inf. Theory 48(2): 529-534 (2002) - [j24]Irina E. Bocharova, Marc Handlery, Rolf Johannesson, Boris D. Kudryashov:
Tailbiting codes obtained via convolutional codes with large active distance-slopes. IEEE Trans. Inf. Theory 48(9): 2577-2587 (2002) - 2001
- [j23]Victor V. Zyablov, Sergo Shavgulidze, Rolf Johannesson:
On the error exponent for woven convolutional codes with inner warp. IEEE Trans. Inf. Theory 47(3): 1195-1199 (2001) - 2000
- [j22]Rolf Johannesson, Per Ståhl, Emma Wittenmark:
A note on type II convolutional codes. IEEE Trans. Inf. Theory 46(4): 1510-1514 (2000)
1990 – 1999
- 1999
- [j21]Stefan Höst, Rolf Johannesson, Kamil Sh. Zigangirov, Victor V. Zyablov:
Active Distances for Convolutional Codes. IEEE Trans. Inf. Theory 45(2): 658-669 (1999) - [j20]Victor V. Zyablov, Sergo Shavgulidze, Oleg Skopintsev, Stefan Höst, Rolf Johannesson:
On the error exponent for woven convolutional codes with outer warp. IEEE Trans. Inf. Theory 45(5): 1649-1653 (1999) - [j19]Rolf Johannesson, Per Ståhl:
New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile. IEEE Trans. Inf. Theory 45(5): 1653-1658 (1999) - [j18]Per Ståhl, John B. Anderson, Rolf Johannesson:
Optimal and near-optimal encoders for short and moderate-length tail-biting trellises. IEEE Trans. Inf. Theory 45(7): 2562-2571 (1999) - 1998
- [j17]Harro Osthoff, John B. Anderson, Rolf Johannesson, Chin-foo Lin:
Systematic Feed-Forward Convolutional Encoders Are Better than Other Encoders with an M-Algorithm Decoder. IEEE Trans. Inf. Theory 44(2): 831-838 (1998) - [j16]Rolf Johannesson, Zhe-xian Wan, Emma Wittenmark:
Some Structural Properties of Convolutional Codes over Rings. IEEE Trans. Inf. Theory 44(2): 839-845 (1998) - [j15]Rolf Johannesson, Emma Wittenmark:
Two 16-State, Rate R = 2/4 Trellis Codes Whose Free Distances Meet the Heller Bound. IEEE Trans. Inf. Theory 44(4): 1602-1604 (1998) - 1996
- [j14]G. David Forney Jr., Rolf Johannesson, Zhe-xian Wan:
Minimal and canonical rational generator matrices for convolutional codes. IEEE Trans. Inf. Theory 42(6): 1865-1880 (1996) - 1995
- [j13]Rolf Johannesson:
Review of 'Algebraic Methods for Signal Processing and Communications Coding' (Blahut, R.E.; 1991). IEEE Trans. Inf. Theory 41(3): 864- (1995) - 1993
- [j12]Rolf Johannesson, Zhe-xian Wan:
A linear algebra approach to minimal convolutional encoders. IEEE Trans. Inf. Theory 39(4): 1219-1233 (1993) - 1992
- [b1]Rolf Johannesson:
Informationstheorie - Grundlage der (Tele-)Kommunikation. Addison-Wesley 1992, ISBN 978-3-89319-465-0, pp. 1-302 - 1991
- [j11]Rolf Johannesson, Andrea Sgarro:
Strengthening Simmons' bound on impersonation. IEEE Trans. Inf. Theory 37(4): 1182-1185 (1991)
1980 – 1989
- 1989
- [j10]Mats L. Cedervall, Rolf Johannesson:
A fast algorithm for computing distance spectrum of convolutional codes. IEEE Trans. Inf. Theory 35(6): 1146-1159 (1989) - 1988
- [j9]Vladimir Sidorenko, Rolf Johannesson, Kamil Sh. Zigangirov:
On sequential decoding for the Gilbert channel. IEEE Trans. Inf. Theory 34(5): 1058-1061 (1988) - 1985
- [j8]Rolf Johannesson, Kamil Sh. Zigangirov:
On the distribution of the number of computations in any finite number of subtrees for the stack algorithm. IEEE Trans. Inf. Theory 31(1): 100-102 (1985) - 1984
- [j7]Mats L. Cedervall, Rolf Johannesson, Kamil Sh. Zigangirov:
A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes. IEEE Trans. Inf. Theory 30(5): 762-766 (1984)
1970 – 1979
- 1979
- [j6]Rolf Johannesson:
On the distribution of computation for sequential decoding using the stack algorithm. IEEE Trans. Inf. Theory 25(3): 323-331 (1979) - 1978
- [j5]Rolf Johannesson, Erik Paaske:
Further results on binary convolutional codes with an optimum distance profile (Corresp.). IEEE Trans. Inf. Theory 24(2): 264-268 (1978) - 1977
- [j4]Rolf Johannesson:
Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile (Corresp.). IEEE Trans. Inf. Theory 23(2): 281-283 (1977) - [j3]Rolf Johannesson:
On the error probability of general trellis codes with applications to sequential decoding (Corresp.). IEEE Trans. Inf. Theory 23(5): 609-611 (1977) - 1976
- [j2]Rolf Johannesson:
Some long rate one-half binary convolutional codes with an optimum distance profile (Corresp.). IEEE Trans. Inf. Theory 22(5): 629-631 (1976) - 1975
- [j1]Rolf Johannesson:
Robustly optimal rate one-half binary convolutional codes (Corresp.). IEEE Trans. Inf. Theory 21(4): 464-468 (1975)
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 23:08 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:
