Anpassa utseende English Lunds universitet
Institutionen för EIT
toppbild
Utbildning Forskning Kontakt
Rolf Johannesson
Professor, TeknD, docent

Publikationer


Books

  1. J. B. Anderson, R. Johannesson:
    Understanding Information Transmission
    Understanding Technology Series, ISSN 978-0-471-67910-3, John Wiley & Sons, 2005. (BibTeX) (More info)
  2. R. Johannesson, K. Zigangirov:
    Fundamentals of convolutional coding
    Digital and Mobile Communication, ISBN 0-7803-3483-3, IEEE Press, 1999. (BibTeX) (More info)
  3. R. Johannesson:
    Informationstheorie - Die Grundlage der Telekommunikation (in German)
    ISBN 3-89319-465-7, Addison-Wesley, 1992. (BibTeX) (More info)
  4. R. Johannesson:
    Informationsteori - grundvalen för (tele-)kommunikation
    ISBN 91-44-28421-7, Studentlitteratur, 1988. (BibTeX) (More info)
  5. M. Cedervall, R. Johannesson:
    Digitalteknik - steg för steg - arbetsbok
    ISBN 91-44-22461-3, Studentlitteratur, 1984. (BibTeX) (More info)
  6. M. Cedervall, R. Johannesson:
    Digitalteknik - arbetsbok
    ISBN 91-44-22051-0, Studentlitteratur, 1984. (BibTeX) (More info)
  7. R. Johannesson:
    Digitalteknik - steg för steg
    ISBN 91-44-20421-3, Studentlitteratur, 1983. (BibTeX) (More info)
  8. R. Johannesson:
    Digitalteknik
    ISBN 91-44-19861-2, Studentlitteratur, 1982. (BibTeX) (More info)

Book Chapters

  1. M. Handlery, R. Johannesson, P. Ståhl:
    Tailbiting convolutional codes
    Encyclopedia of Telecommunications (EoT), ISBN 978-0-471-36972-1, Wiley, 2003. (BibTeX) (More info)
  2. R. Johannesson, J. L. Massey, P. Ståhl:
    Systematic bits are better and no buts about it
    Codes, Graphs, and Systems, pp. 77-89, ISBN 0792376862, Kluwer Academic Publisher, 2002. (BibTeX) (More info)
  3. R. Johannesson:
    Rudified convolutional encoders
    Numbers, Information and Complexity, pp. 283-294, ISBN 0-7923-7765-6, Kluwer Academic Publishers, 2000. (BibTeX) (More info)
  4. R. Johannesson:
    Claude E. Shannon (in Swedish)
    Nationalencyclopedien, Bra Böcker, Sweden, 1995. (BibTeX) (More info)
  5. R. Johannesson:
    Information theory (in Swedish)
    Nationalencyclopedien, pp. 456-, Bra Böcker, Sweden, 1995. (BibTeX) (More info)
  6. R. Johannesson:
    Cryptology (in Swedish)
    Nationalencyclopedien, pp. 484-486, Bra Böcker, Sweden, 1995. (BibTeX) (More info)
  7. R. Johannesson, Z. X. Wan:
    On canonical encoding matrices and the generalized constraint lengths of convolutional codes
    Cryptography and Communication, pp. 187-199, ISBN 0-7923-9469-0, Kluwer Academic Publisher, 1994. (BibTeX) (More info)
  8. R. Johannesson, K. Zigangirov:
    Distances and distance bounds for convolutional codes - an overview
    Topics in coding theory - in honour of Lars H. Zetterberg, pp. 109-136, ISBN 0-387-51405-8, Springer-Verlag, 1989. (BibTeX) (More info)

Journal Articles

    2012

  1. I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov, R. Satyukov:
    Searching for voltage graph-based LDPC tailbiting codes with large girth
    IEEE Transactions on Information Theory, Vol. 58, No. 4, pp. 2265-2279, 2012. (BibTeX) (More info)
  2. I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov:
    A note on duality and MacWilliams-type identities for convolutional codes
    Problems of Information Transmission, No. 1, 2012. (BibTeX) (More info)
  3. I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov:
    A Closed Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes
    IEEE Transactions on Information Theory, Vol. 58, No. 7, pp. 4635-4644, 2012. (BibTeX) (More info)
  4. I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov:
    A Closed-Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes
    IEEE Transactions on Information Theory, Vol. 58, No. 7, pp. 4635-4644, 2012. (BibTeX) (More info)
  5. I. E. Bocharova, F. Hug, R. Johannesson, B. D. Kudryashov:
    Dual convolutional codes and the MacWilliams identities
    Problems Of Information Transmission, Vol. 48, No. 1, pp. 21-30, 2012. (BibTeX) (More info)

    6. 2011

  6. I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov:
    Woven convolutional graph codes with large free distances
    Problems of Information Transmission, Vol. 47, No. 1, pp. 1-14, 2011. (BibTeX) (More info)

    7. 2010

  7. I. Bocharova, R. Johannesson, B. Kudryashov, V. Zyablov:
    Woven graph codes: asymptotic performances and examples
    IEEE Transactions on Information Theory, Vol. 56, No. 1, pp. 121-129, 2010. (BibTeX) (More info)
  8. F. Hug, I. Bocharova, R. Johannesson, B. Kudryashov:
    A rate R=5/20 hypergraph-based woven convolutional code with free distance 120
    IEEE Transactions on Information Theory, Vol. 56, No. 4, pp. 1618-1623, 2010. (BibTeX) (More info)

    9. 2009

  9. V. Zyablov, R. Johannesson, M. Loncar:
    Low-complexity error correction of Hamming-code-based LDPC codes
    Problems of Information Transmission, Vol. 45, No. 2, pp. 95-109, 2009. (BibTeX) (More info)

    10. 2008

  10. I. Bocharova, B. Kudryashov, R. Johannesson, M. Loncar:
    An improved bound on the list error probability and list distance properties
    IEEE Transactions on Information Theory, Vol. 54, No. 1, pp. 13-32, 2008. (BibTeX) (More info)
  11. M. Loncar, R. Johannesson, I. Bocharova, B. Kudryashov:
    Soft-output BEAST decoding with application to product Codes
    IEEE Transactions On Information Theory, Vol. 54, No. 3, pp. 1036-1049, 2008. (BibTeX) (More info)

    12. 2007

  12. I. Bocharova, R. Johannesson, B. Kudryashov:
    Trellis complexity of short linear codes
    IEEE Transactions on Information Theory, Vol. 53, No. 1, pp. 361-368, 2007. (BibTeX) (More info)

    13. 2006

  13. V. Pavlushkov, R. Johannesson, V. Zyablov:
    Unequal error protection for convolutional codes
    IEEE Transactions on Information Theory, Vol. 52, No. 2, pp. 700-708, 2006. (BibTeX) (More info)

    14. 2005

  14. I. Bocharova, M. Handlery, R. Johannesson, B. Kudryashov:
    BEAST decoding of block codes obtained via convolutional codes
    IEEE Transactions on Information Theory, Vol. 51, No. 5, pp. 1880-1891, 2005. (BibTeX) (More info)
  15. R. Johannesson, V. Pavlushkov, V. V. Zyablov:
    Woven constructions for multi-level information protection
    Information Processes (Electronic Scientific Journal), Vol. 5, No. 2, pp. 159-172, 2005. (BibTeX) (More info)
  16. R. Johannesson, V. Pavlushkov, V. Zyablov:
    Achieving unequal error protection via woven codes: Construction and analysis
    Information Processes (Electronic Scientific Journal), Vol. 5, No. 2, pp. 132-158, 2005. (BibTeX) (More info)

    17. 2004

  17. R. Jordan, S. Höst, R. Johannesson, M. Bossert, V. Zyablov:
    Woven convolutional codes II: Decoding aspects
    IEEE Transactions on Information Theory, Vol. 50, No. 10, pp. 2522-2529, 2004. (BibTeX) (More info)
  18. I. Bocharova, R. Johannesson, B. Kudryashov:
    Low state complexity block codes via convolutional codes
    IEEE TRANSACTIONS ON INFORMATION THEORY, Vol. 50, No. 9, pp. 2022-2030, 2004. (BibTeX) (More info)
  19. I. Bocharova, R. Johannesson, B. Kudryashov, M. Loncar:
    BEAST decoding for block codes
    European Transactions on Telecommunications, Vol. 15, No. 4, pp. 297-305, 2004. (BibTeX) (More info)
  20. M. Handlery, R. Johannesson, V. Zyablov:
    On error exponents for woven convolutional codes with one tailbiting component code
    IEEE TRANSACTIONS ON INFORMATION THEORY, Vol. 50, No. 8, pp. 1809-1811, 2004. (BibTeX) (More info)
  21. I. Bocharova, M. Handlery, R. Johannesson, B. Kudryashov:
    A BEAST for prowling in trees
    IEEE Transactions on Information Theory, Vol. 50, No. 6, pp. 1295-1302, 2004. (BibTeX) (More info)
  22. R. Jordan, R. Johannesson, M. Bossert:
    Nested convolutional codes and their application to woven codes
    IEEE Transactions on Information Theory, Vol. 50, No. 2, pp. 380-384, 2004. (BibTeX) (More info)
  23. V. V. Zyablov, R. Johannesson, V. Pavlushkov:
    Detecting and correcting capabilities of convolutional codes
    Problems of Information Transmission, Vol. 40, No. 3, pp. 187-194, 2004. (BibTeX) (More info)

    24. 2003

  24. M. Handlery, R. Johannesson, V. V. Zyablov:
    Boosting the error performance of suboptimal tailbiting decoders
    IEEE Transactions on Communications, Vol. 51, No. 9, pp. 1485-1491, 2003. (BibTeX) (More info)

    25. 2002

  25. S. Höst, R. Johannesson, V. Zyablov:
    Woven convolutional codes I: Encoder properties
    IEEE Transactions on Information Theory, Vol. 48, No. 1, pp. 149-161, 2002. (BibTeX) (More info)
  26. S. Höst, R. Johannesson, V. V. Zyablov:
    A distance measure tailored to tailbiting codes
    Problems of Information Transmission, Vol. 38, No. 4, pp. 280-295, 2002. (BibTeX) (More info)
  27. I. Bocharova, M. Handlery, R. Johannesson, B. Kudryashov:
    Tailbiting codes obtained via convolutional codes with large active distance-slopes
    IEEE TRANSACTIONS ON INFORMATION THEORY, Vol. 48, No. 9, pp. 2577-2587, 2002. (BibTeX) (More info)
  28. P. Ståhl, J. B. Anderson, R. Johannesson:
    A note on tailbiting codes and their feedback encoders
    IEEE Transactions on Information Theory, Vol. 48, No. 2, pp. 529-534, 2002. (BibTeX) (More info)
  29. I. Bocharova, R. Johannesson, B. Kudryashov, P. Ståhl:
    Tailbiting codes: Bounds and search results
    IEEE TRANSACTIONS ON INFORMATION THEORY, Vol. 48, No. 1, pp. 137-148, 2002. (BibTeX) (More info)
  30. M. Handlery, R. Johannesson, V. V. Zyablov:
    A distance approach to window decoding
    Problems of Information Transmission, Vol. 38, No. 3, pp. 169-181, 2002. (BibTeX) (More info)
  31. M. Handlery, R. Johannesson, V. V. Zyablov:
    Encoder and distance properties of woven convolutional codes with one tailbiting component code
    Problems of Information Transmission, Vol. 38, No. 1, pp. 41-49, 2002. (BibTeX) (More info)
  32. R. Johannesson, P. Ståhl:
    A Note on Systematic Tailbiting Encoders
    Problems of Information Transmission, Vol. 38, No. 1, pp. 55-64, 2002. (BibTeX) (More info)

    33. 2001 and earlier

  33. V. V. Zyablov, S. Shavgulidze, R. Johannesson:
    On the error exponent for woven convolutional codes with inner warp
    IEEE Transactions on Information Theory, Vol. 47, No. 3, pp. 1195-1199, 2001. (BibTeX) (More info)
  34. R. Johannesson, P. Ståhl, E. Wittenmark:
    A note on Type II covolutional codes
    IEEE Transactions on Information Theory, Vol. 46, pp. 1510-1514, 2000. (BibTeX) (More info)
  35. V. V. Zyablov, O. D. Skopinsev, S. Höst, R. Johannesson:
    Asymptotic distance properties of binary woven convolutional codes
    Problems of Information Transmission, Vol. 35, No. 4, pp. 311-326, 1999. (BibTeX) (More info)
  36. V. V. Zyablov, S. Shavgulidze, O. Skopintsev, S. Höst, R. Johannesson:
    On the error exponent for woven convolutional codes with outer warps
    IEEE Transactions on Information Theory, Vol. 45, No. 5, pp. 1649-1653, 1999. (BibTeX) (More info)
  37. S. Höst, R. Johannesson, K. Zigangirov, V. V. Zyablov:
    Active distances for convolutional codes
    IEEE Transactions on Information Theory, Vol. 45, No. 2, pp. 658-669, 1999. (BibTeX) (More info)
  38. P. Ståhl, J. B. Anderson, R. Johannesson:
    Optimal and near-optimal encoders for short and moderate-length tailbiting trellises
    IEEE Transactions on Information Theory, Vol. 45, No. 7, pp. 2562-2571, 1999. (BibTeX) (More info)
  39. R. Johannesson, P. Ståhl:
    New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile
    IEEE Transactions on Information Theory, Vol. 45, No. 5, pp. 1653-1658, 1999. (BibTeX) (More info)
  40. S. Höst, R. Johannesson, V. V. Zyablov:
    Nonequivalent cascaded convolutional codes obtained from equivalent constituent convolutional encoders
    Problems of Information Transmission, Vol. 34, No. 4, pp. 291-299, 1998. (BibTeX) (More info)
  41. R. Johannesson, E. Wittenmark:
    Two 16-state, rate R=2/4 trellis codes whose free distances meet the Heller bound
    IEEE Transactions on Information Theory, Vol. 44, No. 4, pp. 1602-1604, 1998. (BibTeX) (More info)
  42. R. Johannesson, Z. X. Wan, E. Wittenmark:
    Some structural properties of convolutional codes over rings
    IEEE Transactions on Information Theory, Vol. 44, No. 2, pp. 839-845, 1998. (BibTeX) (More info)
  43. H. Osthoff, J. B. Anderson, R. Johannesson, C. f. Lin:
    Systematic feed-forward convolutional encoders are better than other encoders with an M-algorithm decoder
    IEEE Transactions on Information Theory, Vol. 44, pp. 831-838, 1998. (BibTeX) (More info)
  44. G. D. Forney, Jr., R. Johannesson, Z. X. Wan:
    Minimal and canonical rational generator matrices for convolutional codes
    IEEE Transactions on Information Theory, Vol. 42, No. 6, Part 1, pp. 1865-1880, 1996. (BibTeX) (More info)
  45. R. Johannesson, K. Zigangirov:
    On the theory of list decoding of convolutional codes
    Problems of Information Transmission, Vol. 32, No. 1, pp. 104-111, 1996. (BibTeX) (More info)
  46. R. Johannesson, Z. X. Wan:
    A linear algebra approach to minimal convolutional encoders
    IEEE Transactions on Information Theory, Vol. 39, No. 4, pp. 1219-1233, 1993. (BibTeX) (More info)
  47. R. Johannesson, K. Zigangirov:
    A trellis coding scheme based on signal alphabet splitting
    Problems of Information Transmission, Vol. 28, No. 4, pp. 308-316, 1992. (BibTeX) (More info)
  48. R. Johannesson, A. Sgarro:
    Strengthening Simmon's bound on impersonation
    IEEE Transactions on Information Theory, Vol. 37, No. 4, pp. 1182-1185, 1991. (BibTeX) (More info)
  49. M. Cedervall, R. Johannesson:
    A fast algorithm for computing distance spectrum of convolutional codes
    IEEE Transactions on Information Theory, Vol. 35, No. 6, pp. 1146-1159, 1989. (BibTeX) (More info)
  50. R. Johannesson, V. Sidorenko, K. Zigangirov:
    On sequential decoding for the Gilbert channel
    IEEE Transactions on Information Theory, Vol. 34, No. 5, part 1, pp. 1058-1061, 1988. (BibTeX) (More info)
  51. R. Johannesson, K. Zigangirov:
    On the distribution of the number of computations in any finite number of subtrees for the stack algorithm
    IEEE Transactions on Information Theory, Vol. 31, No. 1, pp. 100-102, 1985. (BibTeX) (More info)
  52. M. Cedervall, R. Johannesson, K. Zigangirov:
    A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes
    IEEE Transactions on Information Theory, Vol. 30, No. 5, pp. 762-766, 1984. (BibTeX) (More info)
  53. T. Herlestam, R. Johannesson:
    On computing logarithms over GF(2p)
    BIT, Vol. 21, No. 3, pp. 326-334, 1981. (BibTeX) (More info)
  54. R. Johannesson:
    On the distribution of computation for sequential decoding using the stack algorithm
    IEEE Transactions on Information Theory, Vol. 25, No. 3, pp. 323-331, 1979. (BibTeX) (More info)
  55. R. Johannesson, E. Paaske:
    Further results on binary convolutional codes with an optimum distance profile
    IEEE Transactions on Information Theory, Vol. 24, No. 2, pp. 264-268, 1978. (BibTeX) (More info)
  56. R. Johannesson:
    On the error probability of general trellis codes with applications to sequential decoding
    IEEE Transactions on Information Theory, Vol. 23, No. 5, pp. 609-611, 1977. (BibTeX) (More info)
  57. R. Johannesson:
    Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile
    IEEE Transactions on Information Theory, Vol. 23, No. 2, pp. 281-283, 1977. (BibTeX) (More info)
  58. R. Johannesson:
    Some long rate one-half binary convolutional codes with an optimum distance profile
    IEEE Transactions on Information Theory, Vol. 22, No. 5, pp. 629-631, 1976. (BibTeX) (More info)
  59. R. Johannesson:
    Robustly-optimal rate one-half binary convolutional codes
    IEEE Transactions on Information Theory, Vol. 21, No. 4, pp. 464-468, 1975. (BibTeX) (More info)

Conference Papers (Peer reviewed)

    2012

  1. I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov:
    A Greedy Search for Improved QC LDPC Codes with Good Girth Profile and Degree Distribution
    International Symposium on Information Theory (ISIT), Cambridge, MA, USA, 2012-07-01/2012-07-06. (BibTeX) (More info)
  2. I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov:
    High-Rate QC LDPC Codes of Short and Moderate Length with Good Girth Profile
    7th International Symposium on Turbo Codes & Iterative Information Processing, Gothenburg, Sweden, 2012-08-27/2012-08-31. (BibTeX) (More info)

    3. 2011

  3. I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov, R. Satyukov:
    Some Voltage Graph-Based LDPC Tailbiting Codes with Large Girth
    International Symposium on Information Theory (ISIT), St. Petersburg, Russia, 2011-07-31/2011-08-05. (BibTeX) (More info)
  4. I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov:
    Double-Hamming based QC LDPC codes with large minimum distance
    International Symposium on Information Theory (ISIT), St. Petersburg, 2011-07-31/2011-08-05. (BibTeX) (More info)
  5. I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov:
    Another look at the exact bit error probability for Viterbi decoding of convolutional codes
    International Mathematical Conference '50 Years Of IPPI', Moscow, Russia, 2011-07-25/2011-07-29. (BibTeX) (More info)
  6. I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov:
    On the exact bit error probability for Viterbi decoding of convolutional codes
    Information Theory and Applications Workshop, San Diego, 2011-02-06/2011-02-11. (BibTeX) (More info)

    7. 2010

  7. I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov:
    On weight enumerators and MacWilliams identity for convolutional codes
    Information Theory and Applications Workshop, San Diego, 2010-01-31/2010-02-05. (BibTeX) (More info)
  8. I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov, R. Satyukov:
    New low-density parity-check codes with large girth based on hypergraphs
    International Symposium on Information Theory (ISIT), Austin, 2010-06-13/2010-06-18. (BibTeX) (More info)

    9. 2009

  9. V. Zyablov, F. Hug, R. Johannesson:
    Chained Gallager codes
    International Symposium on Problems of Redundancy in Information and Control Systems, St. Petersburg, 2009-05-26/2009-05-30. (BibTeX) (More info)
  10. F. Hug, I. Bocharova, R. Johannesson, B. Kudryashov:
    Searching for high-rate convolutional codes via binary syndrome trellises
    International Symposium on Information Theory (ISIT), Seoul, pp. 1358-1362, 2009-06-28/2009-07-03. (BibTeX) (More info)

    11. 2008

  11. I. Bocharova, R. Johannesson, B. Kudryashov, V. V. Zyablov:
    Woven graph codes over hypergraphs
    7th International ITG Conference on Source and Channel Coding (SCC'08), Ulm, Germany, 2008-01-14/2008-01-16. (BibTeX) (More info)
  12. V. Zyablov, M. Loncar, R. Johannesson, P. Rybin:
    On the Erasure-Correcting Capabilities of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes
    11th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT08), Pamporovo, Bulgaria, 2008-06-16. (BibTeX) (More info)
  13. V. Zyablov, M. Loncar, R. Johannesson:
    On the Asymptotic Performance of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes
    5th Int. Symp. Turbo Codes & Related Topics, Lausanne, Switzerland, 2008-09-01. (In press) (BibTeX) (More info)
  14. V. Zyablov, M. Loncar, R. Johannesson:
    On the Expanding Properties of Gallager's LDPC Matrices
    Workshop "Coding Theory Days in St. Petersburg", St. Petersburg, Russia, 2008-10-06. (In press) (BibTeX) (More info)
  15. I. Bocharova, B. Kudryashov, R. Johannesson, V. Zyablov:
    Asymptotic performance of woven graph codes
    IEEE International Symposium on Information Theory, Toronto, Canada, pp. 1025-1029, 2008-07-06/2008-07-11. (BibTeX) (More info)
  16. V. Zyablov, M. Loncar, R. Johannesson, P. Rybin:
    On the Error-Correcting Capabilities of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes
    11th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT08), Pamporovo, Bulgaria, 2008-06-16. (BibTeX) (More info)

    17. 2007

  17. M. Loncar, R. Johannesson, I. Bocharova, B. Kudryashov:
    A comparison of some trellis- and tree-based SISO algorithms for decoding and equalization
    IEEE International Symposium on Information Theory, Nice, France, pp. 1696-1700, 2007-06-24/2007-06-29. (BibTeX) (More info)
  18. I. Bocharova, B. Kudryashov, R. Johannesson, V. Zyablov:
    Asymptotically good woven codes with fixed constituent convolutional codes
    IEEE International Symposium on Information Theory, Nice, France, 2007-06-24/2007-06-29. (BibTeX) (More info)

    19. 2006

  19. M. Loncar, R. Johannesson, J. Sayir, I. Bocharova, B. Kudryashov:
    On suboptimum component decoding for product codes
    2006 IEEE International Symposium on Information Theory, Seattle, WA, USA, pp. 2240-2244, 9-14 July 2006. (BibTeX) (More info)
  20. I. Bocharova, B. Kudryashov, R. Johannesson:
    Trellis complexity for short linear codes
    Tenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-10), Zvenigorod, Russia, 2006-09-03/2006-09-09. (BibTeX) (More info)
  21. I. Bocharova, B. Kudryashov, R. Johannesson, M. Loncar:
    An improved bound on the list error probability and list distance properties
    2006 IEEE International Symposium on Information Theory, IEEE International Symposium on Information Theory (ISIT06), Seattle, WA, USA, pp. 719-723, 2006-07-09/2006-07-14. (BibTeX) (More info)
  22. R. Johannesson:
    Stumbling through a tree
    The Revival of Sequential Decoding Workshop, Munich, Germany, 2006-05-31/2006-06-02. (BibTeX) (More info)
  23. M. Loncar, R. Johannesson, I. Bocharova, B. Kudryashov:
    Interative BEAST-decoding of product codes
    4th International Symposium on Turbo Codes & Related Topics, Munich, Germany, 2006-04-03/2006-04-07. (BibTeX) (More info)

    24. 2005

  24. V. Pavlushkov, R. Johannesson, V. Zyablov:
    Unequal error protection explained by state-transition graphs
    2005 IEEE International Symposium on Information Theory (ISIT), Adelaide, SA, Australia, pp. 2236-2240, 4-9 Sept. 2005. (BibTeX) (More info)
  25. M. Loncar, R. Johannesson, I. Bocharova, B. Kudryashov:
    Estimating the list size for BEAST-APP decoding
    2005 IEEE International Symposium on Information Theory (ISIT), Adelaide, SA, Australia, pp. 1126-1130, 4-9 Sept. 2005. (BibTeX) (More info)
  26. I. Bocharova, R. Johannesson, B. Kudryashov:
    BEAST decoding - asymptotic complexity
    2005 IEEE Information Theory Workshop, IEEE IT SOC Information Theory Workshop 2005 on Coding and Complexity, Rotorua, New Zealand, 2005-08-29/2005-09-01. (BibTeX) (More info)

    27. 2004

  27. V. Pavlushkov, R. Johannesson, V. V. Zyablov:
    On unequal error protection for information symbols via active distances
    Proceedings. 2004 IEEE International Symposium on Information Theory (IEEE Cat. No.04CH37522), Chicago, IL, USA, pp. 452-452, 27 June-2 July 2004. (BibTeX) (More info)
  28. S. Ertl, R. Johannesson, V. Pavlushkov:
    A new look at the error-correcting capabilities of convolutional codes
    Proceedings. 2004 IEEE International Symposium on Information Theory, Chicago, IL, USA, pp. 406-406, 27 June-2 July 2004. (BibTeX) (More info)
  29. I. Bocharova, R. Johannesson, B. Kudryashov, M. Loncar:
    On APP-decoding using BEAST
    International Symposium on Information Theory. ISIT 2004. Proceedings., 2004 IEEE International Symposium on Information Theory, Chicago, Ill., pp. 345-, 2004-06-27/2004-07-02. (BibTeX) (More info)
  30. R. Johannesson, V. Pavlushkov, V. V. Zyablov:
    On unequal error protection for code symbols via active distances
    International Workshop on Algebraic and Combinatorial Coding Theory (ACCT), Kranevo, Bulgaria, 2004-06-19/2004-2004-06-25. (BibTeX) (More info)
  31. J. L. Massey, P. C. Massey, R. Johannesson:
    An atypical approach to carrier modulation
    4th ETH-Technion Information Theory Workshop, Zurich, Switzerland, 2004-02-16/2004-02-17. (BibTeX) (More info)
  32. I. Bocharova, R. Johannesson, B. Kudryashov, M. Loncar:
    BEAST decoding for block codes
    ITG-Fachbericht, 5th International ITG Conference on Source and Channel Coding (SCC), Erlangen, Germany, No. 181, pp. 173-178, 2004-01-14/2004-01-16. (BibTeX) (More info)

    33. 2003

  33. V. Pavlushkov, R. Johannesson, V. V. Zyablov:
    On the burst error detecting and erasure correcting capabilities of convolutional codes
    IEEE International Symposium on Information Theory - Proceedings, Proceedings 2003 IEEE International Symposium on Information Theory (ISIT), Yokohama, Japan, pp. 422-422, Jun 29-Jul 4 2003. (BibTeX) (More info)
  34. I. Bocharova, R. Johannesson, B. Kudryashov:
    Low state complexity block codes via convolutional codes
    IEEE International Symposium on Information Theory, 2003. Proceedings., 2003 IEEE International Symposium on Information Theory, Yokohama, Japan, pp. 394-, 2003-06-29/2003-07-04. (BibTeX) (More info)
  35. R. Johannesson, V. Pavlushkov, V. V. Zyablov:
    On the error detecting and erasure correcting capabilities of convolutional codes
    3rd European-Asian Workshop on Information Theory, Kamogawa, Japan, 2003-06-25/2003-06-28. (BibTeX) (More info)
  36. J. L. Massey, R. Johannesson:
    A new look at Shannon bandwidth
    3rd European-Asian Workshop on Information Theory, Kamogawa, Japan, 2003-06-25/2003-06-28. (BibTeX) (More info)

    37. 2002

  37. M. Handlery, R. Johannesson, V. V. Zyablov:
    On the error correcting capability of convolutional codes: Old and new
    ITG-Fachbericht, 4th International ITG Conference on Source and Channel Coding, Berlin, Germany, No. 170, pp. 11-18, Jan 28-30 2002. (BibTeX) (More info)
  38. I. Bocharova, M. Handlery, R. Johannesson, B. Kudryashov:
    Trellis representations for quasi-cyclic codes
    8th International Workshop on Algebraic and Combinatorial Coding Theory, Tsarskoe Selo, Russia, 2002-09-08/2002-09-14. (BibTeX) (More info)
  39. R. Jordan, R. Johannesson, M. Bossert:
    On nested convolutional codes
    IEEE International Symposium on Information Theory, 2002. Proceedings., 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, pp. 425-, 2002-06-30/2002-07-05. (BibTeX) (More info)
  40. I. Bocharova, M. Handlery, R. Johannesson, B. Kudryashov:
    How to efficiently find the minimum distance of tailbiting codes
    IEEE International Symposium on Information Theory, 2002. Proceedings., 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, pp. 259-, 2002-06-30/2002-07-05. (BibTeX) (More info)
  41. I. Bocharova, M. Handlery, R. Johannesson, B. Kudryashov:
    Convolutional codes with large slopes yield better tailbiting codes
    IEEE International Symposium on Information Theory, 2002. Proceedings., 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, pp. 258-, 2002-06-30/2002-07-05. (BibTeX) (More info)
  42. R. Johannesson:
    On tennis trellises, state-transition diagrams, Carl Nielsen and Jim Massey
    Workshop on Concepts in Information Theory - A tribute to Jim Massey, Breisach, Germany, 2002-06-26/2002-06-28. (BibTeX) (More info)
  43. S. Huettinger, J. Huber, R. Johannesson:
    Soft-output-decoding: Some aspects from information theory
    ITG-Fachbericht, 4th International ITG-Conference on Source and Channel Coding, Berlin, Germany, No. 170, pp. 81-89, 2002-02-28/2002-02-30. (BibTeX) (More info)

    44. 2001 and earlier

  44. R. Jordan, S. Höst, R. Johannesson:
    On interleaver design for serially concatenated convolutional codes
    2001 International Symposium on Information Theory, Washington, D.C., pp. 212-, 2001-06-24/2001-06-29. (BibTeX) (More info)
  45. M. Handlery, S. Höst, R. Johannesson, V. V. Zyablov:
    Some distance properties of tailbiting codes
    2001 International Symposium on Information Theory, Washington, D.C., pp. 290-, 2001-06-24/2001-06-29. (BibTeX) (More info)
  46. S. Huettinger, J. Huber, R. Johannesson, R. Fischer:
    Information processing in soft-output decoding
    39th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, 2001-10-03/2001-10-05. (BibTeX) (More info)
  47. I. Bocharova, M. Handlery, R. Johannesson, B. Kudryashov:
    Prowling with a BEAST
    39th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, 2001-10-03/2001-10-05. (BibTeX) (More info)
  48. M. Handlery, R. Johannesson, J. L. Massey, P. Ståhl:
    An upper bound on decoding bit-error probability with linear coding on extremely noisy channels
    2001 International Symposium on Information Theory, Washington, D.C., pp. 131-, 2001-06-24/2001-06-29. (BibTeX) (More info)
  49. R. Jordan, W. Schnug, M. Bossert, S. Höst, R. Johannesson:
    Decoding of woven convolutional codes and simulation results
    2000 International Symposium on Information Theory, Sorrento, Italy, pp. 96-, 2000-06-21/2000-06-25. (BibTeX) (More info)
  50. S. Höst, R. Johannesson, V. V. Zyablov:
    On woven convolutional codes
    10th Joint Conference on Communications and Coding, Obertauern, Austria, 2000-03-11/2000-03-18. (BibTeX) (More info)
  51. I. Bocharova, B. Kudryashov, R. Johannesson, P. Ståhl:
    Searching for tailbiting codes with large minimum distances
    2000 International Symposium on Information Theory, Sorrento, Italy, pp. 341-, 2000-06-21/2000-06-25. (BibTeX) (More info)
  52. P. Ståhl, J. B. Anderson, R. Johannesson:
    The effect of the tailbiting restriction on feedback encoders
    2000 International Symposium on Information Theory, Sorrento, Italy, pp. 343-, 2000-06-21/2000-06-25. (BibTeX) (More info)
  53. R. Johannesson, J. L. Massey, P. Ståhl:
    On the decoding bit error probability for binary convolutional codes
    2000 International Symposium on Information Theory, Sorrento, Italy, pp. 398-, 2000-06-21/2000-06-25. (BibTeX) (More info)
  54. M. Handlery, R. Johannesson, V. V. Zyablov:
    Woven convolutional codes with tailbiting
    Seventh International Workshop on Algebraic and Combinatorial Coding Theory, ACCT'2000, Bansko, Bulgaria, 2000-06-18/2000-06-24. (BibTeX) (More info)
  55. P. Ståhl, R. Johannesson:
    Systematic bits are better also for tailbiting codes
    10th Joint Conference on Communications and Coding, Obertauern, Austria, 2000-03-11/2000-03-18. (BibTeX) (More info)
  56. R. Johannesson, J. L. Massey, P. Ståhl:
    Systematic bits are better
    10th Joint Conference on Communications and Coding, Obertauern, Austria, 2000-03-11/2000-03-18. (BibTeX) (More info)
  57. R. Johannesson:
    Tailbiting: a bridge between block and convolutional codes
    3rd ITG Conference - Source and Channel Coding, Munich, Germany, 2000-01-17/2000-01-19. (BibTeX) (More info)
  58. R. Johannesson, J. L. Massey, P. Ståhl:
    Systematic bits are better and no buts about it
    ForneyFest in honor of G. David Forney, Jr. on the occasion of his 60th birthday, Cambridge, Mass., 2000-03-03/2000-03-04. (BibTeX) (More info)
  59. R. Johannesson:
    Woven convolutional codes: encoder properties and error exponents
    Institute of Mathematics and Its Applications, 1999 Summer Program: Codes, Systems, and Graphical Models, Minneapolis, Minn., 1999-08-02/1999-08-13. (BibTeX) (More info)
  60. S. Höst, R. Johannesson, V. V. Zyablov:
    Woven convolutional codes and their generator matrices
    Winter School on Coding and Information Theory, Ebeltoft, Denmark, 1998-12-13/1998-12-16. (BibTeX) (More info)
  61. S. Höst, R. Johannesson, V. V. Zyablov:
    Decoding of woven convolutional codes with outer warp - preliminary results
    Workshop on Convolutional Codes and their Applications, Kamp Lintfort, Germany, 1998-11-04/1998-11-06. (BibTeX) (More info)
  62. S. Höst, R. Johannesson, V. V. Zyablov, O. Skopintsev:
    Generator matrices of binary woven convolutional codes
    Sixth International Workshop on Algebraic and Combinatorial Coding Theory, Pskov, Russia, 1998-09-06/1998-09-12. (BibTeX) (More info)
  63. V. V. Zyablov, S. Shavgulidze, O. Skopintsev, S. Höst, R. Johannesson:
    On the error exponent for woven convolutional codes with outer warp
    1998 IEEE International Symposium on Information Theory (ISIT), Cambridge, MA, USA, 1998-08-16/1998-08-21. (BibTeX) (More info)
  64. S. Höst, R. Johannesson, V. V. Zyablov:
    Nonequivalent cascaded convolutional codes obtained from equivalent constituent convolutional encoders
    1998 IEEE International Symposium on Information Theory (ISIT), Cambridge, MA, USA, pp. 338-, 1998-08-16/1998-08-21. (BibTeX) (More info)
  65. S. Höst, R. Johannesson, V. R. Sidorenko, K. Zigangirov, V. V. Zyablov:
    Cascaded convolutional codes
    60th Birthday Celebration Conference for Paddy Farrell, Lancaster, England, 1998-01-25/1998-01-28. (BibTeX) (More info)
  66. P. Ståhl, R. Johannesson, J. B. Anderson:
    Recent results on tailbiting encoders
    Winter School on Coding and Information Theory, Ebeltoft, Denmark, 1998-12-13/1998-12-16. (BibTeX) (More info)
  67. R. Johannesson:
    Convolutional codes, encoders, and syndrome formers: old and new
    Workshop on Convolutional Codes and their Applications, Kamp Lintfort, Germany, 1998-11-04/1998-11-06. (BibTeX) (More info)
  68. P. Ståhl, J. B. Anderson, R. Johannesson:
    New tailbiting encoders
    1998 IEEE International Symposium on Information Theory (ISIT), Cambridge, MA, USA, pp. 389-, 1998-08-16/1998-08-21. (BibTeX) (More info)
  69. R. Johannesson, J. B. Anderson:
    A condition for feedback tailbiting convolutional encoders and a short list of allowed feedback polynomials
    32nd Conference on Information Sciences and Systems, Princeton, USA, 1998-03-19. (BibTeX) (More info)
  70. R. Johannesson:
    Rudified convolutional encoders
    Symposium on Numbers, Information and Complexity in honor of Rudolf Ahlswede on the occasion of his 60th birthday, Bielefeld, Germany, 1998-10-08/1998-10-11. (BibTeX) (More info)
  71. S. Höst, R. Johannesson, V. V. Zyablov:
    A first encounter with binary woven convolutional codes
    4th International Symposium on Communication Theory and Applications, Lake District, UK, 1997-07-13/1997-07-18. (BibTeX) (More info)
  72. S. Höst, R. Johannesson, D. K. Zigangirov, K. Zigangirov, V. V. Zyablov:
    On the distribution of the output error burst lengths for Viterbi decoding of convolutional codes
    1997 IEEE International Symposium on Information Theory (ISIT), Ulm, Germany, pp. 108-, 1997-06-29/1997-07-04. (BibTeX) (More info)
  73. S. Höst, R. Johannesson, K. Zigangirov, V. V. Zyablov:
    Active distances and cascaded convolutional codes
    1997 IEEE International Symposium on Information Theory (ISIT), Ulm, Germany, pp. 107-, 1997-06-29/1997-07-04. (BibTeX) (More info)
  74. R. Johannesson, Z. X. Wan, E. Wittenmark:
    Some results on convolutional codes over rings
    1997 IEEE International Symposium on Information Theory (ISIT), Ulm, Germany, pp. 284-, 1997-06-29/1997-07-04. (BibTeX) (More info)
  75. S. Höst, R. Johannesson, K. Zigangirov, V. V. Zyablov:
    Active distances for convolutional codes
    Winter School on Coding and Information Theory, Mölle, Sweden, 1996-12-15/1996-12-18. (BibTeX) (More info)
  76. R. Johannesson, E. Wittenmark:
    Two 16-state, rate R=2/4 trellis codes whose free distance meet the Heller bound
    Winter School on Coding and Information Theory, Mölle, Sweden, 1996-12-15/1996-12-18. (BibTeX) (More info)
  77. G. D. Forney, Jr., R. Johannesson, Z. X. Wan:
    Minimal and canonical rational generator matrices for convolutional codes
    1996 IEEE Workshop on Convolutional Codes, Essen, Germany, 1996-05-22/1996-05-24. (BibTeX) (More info)
  78. E. Wittenmark, R. Johannesson, Z. X. Wan:
    Convolutional codes over rings
    1996 IEEE Workshop on Convolutional Codes, Essen, Germany, 1996-05-22/1996-05-24. (BibTeX) (More info)
  79. R. Johannesson, K. Zigangirov:
    An expurgation upper bound on the probability of corret path loss for time-invariant convolutional codes
    International Conference on Communication Technology , ICCT'96, Beijing, China, Vol. 1, pp. 548-551, 1996-05-05/1996-05-07. (BibTeX) (More info)
  80. S. Höst, R. Johannesson, V. V. Zyablov:
    On the construction of concatenated codes based on binary conventional convolutional codes
    Seventh Joint Swedish-Russian International Workshop on Information Theory, St.-Petersburg, Russia, 1995-06-17/1995-06-22. (BibTeX) (More info)
  81. R. Johannesson, K. Zigangirov:
    Upper bounds on the probability of the correct path loss for list decoding of fixed convolutional codes
    1995 IEEE International Symposium on Information Theory, Whistler, Canada, pp. 163-, 1995-09-17/1995-09-22. (BibTeX) (More info)
  82. G. Bratt, R. Johannesson, K. Zigangirov:
    Decoding procedure capacities for the Gilbert-Elliott channel
    1995 IEEE International Symposium on Information Theory, Whistler, Canada, pp. 288-, 1995-09-17/1995-09-22. (BibTeX) (More info)
  83. R. Johannesson:
    On the error probability for list decoding of convolutional codes
    IEEE Information Theory Workshop, Ryzdana, Poland, 1995-06-25/1995-06-29. (BibTeX) (More info)
  84. R. Johannesson, K. Zigangirov, V. V. Zyablov:
    Lower bounds on the free distance for random concatenated convolutional codes
    Seventh Joint Swedish-Russian International Workshop on Information Theory, St.-Petersburg, Russia, 1995-06-17/1995-06-22. (BibTeX) (More info)
  85. G. Bratt, R. Johannesson, K. Zigangirov:
    Bounds on the number of computations of sequential decoding for the Gilbert-Elliott channel
    Seventh Joint Swedish-Russian International Workshop on Information Theory, St.-Petersburg, Russia, 1995-06-17/1995-06-22. (BibTeX) (More info)
  86. R. Johannesson:
    List decoding of convolutional codes - a Tutorial
    EIDMA Winter Meeting, Veldhoven, the Netherlands, 1994-12-18/1994-12-21. (BibTeX) (More info)
  87. R. Johannesson, Z. X. Wan:
    A generalization of the predictable degree property to rational convolutional encoding matrices
    1994 IEEE International Symposium on Information Theory (ISIT), Trondheim, Norway, pp. 17-, 1994-06-27/1994-07-01. (BibTeX) (More info)
  88. V. Balakirsky, R. Johannesson, K. Zigangirov:
    New results on estimations of the burst and bit error probabilities for fixed convolutional codes
    1994 IEEE International Symposium on Information Theory (ISIT), Trondheim, Norway, pp. 271-, 1994-06-27/1994-07-01. (BibTeX) (More info)
  89. R. Johannesson:
    Different minimality criteria for rational convolutional encoders
    International Winter Meeting on Coding and Information Theory, Essen, Germany, 1993-12-13/1993-12-15. (BibTeX) (More info)
  90. J. Nyström, R. Johannesson, K. Zigangirov:
    Creeper - an algorithm for sequential decoding
    Sixth Joint Swedish-Russian International Workshop on Information Theory, Mölle, Sweden, 1993-08-22/1993-08-27. (BibTeX) (More info)
  91. G. Bratt, R. Johannesson, K. Zigangirov:
    Estimating some important parameters for the Gilbert-Elliott channel using a sequential decoder
    Sixth Joint Swedish-Russian International Workshop on Information Theory, Mölle, Sweden, 1993-08-22/1993-08-27. (BibTeX) (More info)
  92. R. Johannesson, J. Persson, K. Zigangirov:
    Efficient splitting of multidimensional alphabets for modulation codes
    1993 IEEE International Symposium on Information Theory (ISIT), San Antonio, Texas, pp. 288-, 1993-01-17/1993-01-22. (BibTeX) (More info)
  93. R. Johannesson, K. Zigangirov:
    Strengthening Viterbi's upper bound on the bit error probability for maximum likelihood decoding of fixed binary convolutional codes
    1993 IEEE International Symposium on Information Theory (ISIT), San Antonio, Texas, 1993-01-17/1993-01-22. (BibTeX) (More info)
  94. H. Osthoff, R. Johannesson, J. B. Anderson:
    Systematic feed-forward convolutional encoders are as good as other encoders with an M-algorithm decoder
    Abstracts, International Symp. on Information Theory, 1993 IEEE International Symposium on Information Theory (ISIT), San Antonio, Texas, pp. 268-, 1993-01-17/1993-01-22. (BibTeX) (More info)
  95. R. Johannesson, Z. X. Wan:
    On minimal convolutional encoders and the invariance of their generalized constraint lengths
    IEEE Information Theory Workshop, Salvador, Bahia, Brazil, 1992-06-21/1992-06-26. (BibTeX) (More info)
  96. R. Johannesson, Z. X. Wan:
    On the invariance of the general constraint lengths
    Workshop on Information Theory, Oberwolfach, Germany, 1992-04-05/1992-04-11. (BibTeX) (More info)
  97. R. Johannesson, Z. X. Wan:
    A linear algebra approach to minimal convolutional encoders
    International Winter Meeting on Coding and Information Theory, Essen, Germany, 1991-12-15/1991-12-17. (BibTeX) (More info)
  98. R. Johannesson, Z. X. Wan:
    Submodules of Fx^n and convolutional codes
    First China-Japan International Symposium on Ring Theory, Guilin, China, 1991-10-20/1991-10-25. (BibTeX) (More info)
  99. R. Johannesson, K. Zigangirov:
    Estimating the computational cut-off rate for the Gilbert-Elliott channel
    1991 IEEE International Symposium on Information Theory (ISIT), Budapest, Hungary, pp. 291-, 1991-06-23/1991-06-28. (BibTeX) (More info)
  100. R. Johannesson, K. Zigangirov:
    Estimating the computational cut-off rate for the Gilbert-Elliott channel
    Fifth Joint Soviet-Swedish International Workshop on Information Theory: Convolutional Codes; Multi-User Communication, Moscow, USSR, 1991-01-13/1991-01-19. (BibTeX) (More info)
  101. R. Johannesson, A. Sgarro:
    Strengthening Simmons' bound on impersonation
    Fifth Joint Soviet-Swedish International Workshop on Information Theory: Convolutional Codes; Multi-User Communication, Moscow, USSR, 1991-01-13/1991-01-19. (BibTeX) (More info)
  102. H. Osthoff, R. Johannesson, B. Smeets, H. Vinck:
    On the linear M-algorithm
    1990 IEEE International Symposium on Information Theory (ISIT), San Diego, California, 1990-01-14/1990-01-19. (BibTeX) (More info)
  103. R. Johannesson, K. Zigangirov:
    Sequential decoding and Wald's identity
    1990 IEEE International Symposium on Information Theory (ISIT), San Diego, California, 1990-01-14/1990-01-19. (BibTeX) (More info)
  104. R. Johannesson:
    Sequential decoding - an overview
    Joint Workshop on Communication and Coding, Zell am See, Austria, 1990-02-20. (BibTeX) (More info)
  105. R. Johannesson, K. Zigangirov:
    A lower bound on the distance profile for convolutional codes
    Fourth Joint Swedish-Soviet International Workshop on Information Theory, Gotland, Sweden, 1989-08-27/1989-09-01. (BibTeX) (More info)
  106. R. Johannesson:
    Can Simmons' lower bound on impersonation be strengthened?
    Monte Verita Seminar on Future Directions in Cryptography, Ascona, Switzerland, 1989-10-18. (BibTeX) (More info)
  107. H. Vinck, H. Osthoff, R. Johannesson, R. van der Vleuten, B. Smeets:
    Linear complexity decoding for convolutional codes and intersymbol interference channels
    1988 IEEE International Symposium on Information Theory (ISIT), Kobe, Japan, 1988-06-19/1988-06-24. (BibTeX) (More info)
  108. G. Bratt, R. Johannesson, K. Zigangirov:
    On sequential decoding for the Gilbert-Elliott channel
    1988 IEEE International Symposium on Information Theory (ISIT), Kobe, Japan, 1988-06-19/1988-06-24. (BibTeX) (More info)
  109. G. Bratt, R. Johannesson, K. Zigangirov:
    On sequential decoding for the Gilbert-Elliott channel
    Third Joint Soviet-Swedish International Workshop on Information Theory: Convolutional Codes; Multi-User Communication, Sochi, USSR, 1987-05-24/1987-05-30. (BibTeX) (More info)
  110. V. Sidorenko, R. Johannesson, K. Zigangirov:
    On sequential decoding for the Gilbert channel
    1986 IEEE International Symposium on Information Theory (ISIT), Ann Arbor, Michigan, 1986-10-06/1986-10-09. (BibTeX) (More info)
  111. M. Cedervall, R. Johannesson, K. Zigangirov:
    CREEPER - a new algorithm for sequential decoding
    1985 IEEE International Symposium on Information Theory (ISIT), Brighton, England, 1985-06-24/1985-06-28. (BibTeX) (More info)
  112. K. Berglund, R. Johannesson, K. Zigangirov:
    A new sequential decoding algorithm for fading channels
    Second Joint Swedish-Soviet International Workshop on Information Theory, Gränna, Sweden, 1985-04-14/1985-04-19. (BibTeX) (More info)
  113. M. Cedervall, R. Johannesson, K. Zigangirov:
    CREEPER - an easily implementable algorithm for sequential decoding
    Sixth International Symposium on Information Theory, Tashkent, USSR, 1984. (BibTeX) (More info)
  114. M. Cedervall, R. Johannesson:
    How to find good convolutional codes
    URSI General Assembly in Florence, Florence, Italy, 1984. (BibTeX) (More info)
  115. M. Cedervall, R. Johannesson:
    A fast algorithm for computing distance spectrum of convolutional codes
    1983 IEEE International Symposium on Information Theory (ISIT), St. Jovite, Quebec, Canada, 1983-09-26/1983-09-30. (BibTeX) (More info)
  116. R. Johannesson, K. Zigangirov:
    On the distribution of the number of computations in any finite number of subtrees for the stack algorithm
    International Workshop on Convolutional Codes; Multi-User Communication, Sochi, USSR, 1983. (BibTeX) (More info)
  117. M. Cedervall, R. Johannesson:
    A fast algorithm for computing distance spectrum of convolutional codes
    International Workshop on Convolutional Codes; Multi-User Communication, Sochi, USSR, 1983. (BibTeX) (More info)
  118. M. Cedervall, R. Johannesson, K. Zigangirov:
    A new upper bound on the first-event error probability for maximum-likelihood decoding of specific binary convolutional codes
    1982 IEEE International Symposium on Information Theory (ISIT), Les Arcs, France, 1982-06-21/1982-06-25. (BibTeX) (More info)
  119. M. Cedervall, R. Johannesson, K. Zigangirov:
    On an upper bound on the error probability of specific convolutional codes with maximum-likelihood decoding
    1981 IEEE International Symposium on Information Theory (ISIT), Santa Monica, USA, 1981-02-09/1981-02-12. (BibTeX) (More info)
  120. T. Herlestam, R. Johannesson:
    On computing logarithms over GF(2^p) or an attempt to swindle MITRE Corporation
    1981 IEEE International Symposium on Information Theory (ISIT), Santa Monica, USA, 1981-02-09/1981-02-12. (BibTeX) (More info)
  121. M. Cedervall, R. Johannesson:
    On the systematic versus nonsystematic convolutional code question
    1979 IEEE International Symposium on Information Theory (ISIT), Grignano, Italy, 1979-06-25/1979-06-29. (BibTeX) (More info)
  122. R. Johannesson, K. Zigangirov:
    On the distribution of average number of computations for the stack algorithm
    1979 IEEE International Symposium on Information Theory (ISIT), Grignano, Italy, 1979-06-25/1979-06-29. (BibTeX) (More info)
  123. R. Johannesson, E. Paaske:
    Some transparent convolutional codes with a simple encoder inverse
    1977 IEEE International Symposium on Information Theory (ISIT), Ithaca, USA, 1977-10-10/1977-10-14. (BibTeX) (More info)
  124. R. Johannesson, E. Paaske:
    Further results on binary convolutional codes with an optimum distance profile
    1976 IEEE International Symposium on Information Theory (ISIT), Ronneby, Sweden, 1976-06-21/1976-06-24. (BibTeX) (More info)
  125. R. Johannesson:
    On the computational problem with sequential decoding
    1976 IEEE International Symposium on Information Theory (ISIT), Ronneby, Sweden, 1976-06-21/1976-06-24. (BibTeX) (More info)
  126. R. Johannesson:
    Some rate 1/2 binary convolutional codes of various types which are optimal for various criteria
    1974 IEEE International Symposium on Information Theory (ISIT), Notre Dame, Indiana, USA, 1974-10-28/1974-10-29. (BibTeX) (More info)
  127. R. Johannesson:
    On the error probability of sequential decoding
    1973 IEEE International Symposium on Information Theory (ISIT), Ashkelon, Israel, 1973-06-25/1973-06-29. (BibTeX) (More info)

Conference Papers

  1. I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov:
    LDPC codes with large girth based on voltage graphs
    IEEE Information Theory Winter School, Barcelona, Spain, 2011-04-14/2011-04-18. (BibTeX) (More info)
  2. V. Zyablov, F. Hug, R. Johannesson:
    A lower bound on the minimum distance of chained Gallager codes
    IEEE Information Theory Winter School, Loen, Norway, 2009-03-29/2009-04-03. (BibTeX) (More info)

Popular Science Papers

  1. R. Johannesson:
    Cryptology - from Art to Science (in Swedish)
    Lundaforskare föreläser, Vol. 20, pp. 94-101, ISBN 91-7966-059-2, Lund University Press, 1988. (BibTeX) (More info)

Tillbaka

Senast uppdaterad:
Webbansvarig:
Ansvarig utgivare: Prefekt
Institutionen för Elektro- och informationsteknik, LTH, Box 118, 221 00 Lund. Telefon: 046-222 00 00