Publications

Note: In case of equal contributions, authors are given in alphabetical order.

Journal Articles

  • Irina Bocharova, Florian Hug, Rolf Johannesson, Boris Kudryashov, and Roman Satyukov:
    “Searching for voltage graph-based LDPC tailbiting codes with large girth”
    IEEE Transactions on Information Theory, Vol. 58, Issue 4, April 2012. [pdf, 361 KB]
  • Irina Bocharova, Florian Hug, Rolf Johannesson, and Boris Kudryashov:
    “A note on duality and MacWilliams-type identities for convolutional codes”
    Problems of Information Transmission, Vol. 48, No. 2, 2012. [pdf, 267 KB]
  • Irina Bocharova, Florian Hug, Rolf Johannesson, and Boris Kudryashov:
    “Woven convolutional graph codes with large free distances”
    Problems of Information Transmission, Vol. 47, No. 1, 2011. [pdf, 467 KB]
  • Daniel Johnsson, Fredrik Bjärkeson, Martin Hell, and Florian Hug:
    “Searching for new convolutional codes using the cell broadband engine architecture”
    IEEE Communications Letters, Vol. 15, No. 5, May 2011. [pdf, 279 KB]
  • Florian Hug, Irina Bocharova, Rolf Johannesson, and Boris Kudryashov:
    “A Rate R=5/20 Hypergraph-Based Woven Convolutional Code with Free Distance 120″
    IEEE Transactions on Information Theory, Vol. 56, Issue 4, April 2010. [pdf, 578 KB]

Conference Papers (Peer reviewed)

  • Irina Bocharova, Florian Hug, Rolf Johannesson, Boris Kudryashov, and Roman Satyukov:
    “Some Voltage Graph-Based LDPC Tailbiting Codes with Large Girth”
    International Symposium on Information Theory (ISIT), St. Petersburg, Russia,
    July 31 – August 5, 2011. [pdf, 274 KB]
  • Irina Bocharova, Florian Hug, Rolf Johannesson, and Boris Kudryashov:
    “Double-Hamming based QC LDPC codes with large minimum distance”
    International Symposium on Information Theory (ISIT), St. Petersburg, Russia,
    July 31 – August 5, 2011. [pdf, 286 KB]
  • Irina Bocharova, Florian Hug, Rolf Johannesson, and Boris Kudryashov:
    “Another look at the exact bit error probability for Viterbi decoding
    of convolutional codes”     International Mathematical Conference
    ’50 Years Of IPPI’, Moscow, Russia, July 25 – July 29 2011. [pdf, 246 KB]
  • Irina Bocharova, Florian Hug, Rolf Johannesson, and Boris Kudryashov:
    “On the exact bit error probability for Viterbi decoding of convolutional codes”
    Information Theory and Applications Workshop (ITA), San Diego, California, U.S.A.,
    February 06 – February 11, 2011. [pdf, 266 KB]
  • Irina Bocharova, Florian Hug, Rolf Johannesson, Boris Kudryashov, and Roman Satyukov:
    “New low-density parity-check codes with large girth based on hypergraphs”
    International Symposium on Information Theory (ISIT), Austin, Texas, U.S.A.,
    June 13 – June 18, 2010. [pdf, 455 KB]
  • Florian Hug and Fredrik Rusek:
    “The BEAST for Maximum-Likelihood Detection in Non-Coherent MIMO Wireless
    Systems”     International Conference on Communications (ICC), Cape Town, South Africa,
    May 23 – May 27, 2010. [pdf, 365 KB]
  • Irina Bocharova, Florian Hug, Rolf Johannesson, and Boris Kudryashov:
    “On weight enumerators and MacWilliams identity for convolutional codes”
    Information Theory and Applications Workshop (ITA), San Diego, California, U.S.A.,
    January 31 – February 05, 2010. [pdf, 266 KB]
  • Florian Hug, Irina Bocharova, Rolf Johannesson, and Boris Kudryashov:
    “Searching for high-rate convolutional codes via binary syndrome trellises”
    International Symposium on Information Theory (ISIT), Seoul, South Korea,
    June 28 – July 03, 2009. [pdf, 791 KB]
  • Victor Zyablov, Florian Hug, and Rolf Johannesson:
    “Chained Gallager codes”
    International Symposium on Problems of Redundancy in Information and Control Systems, St. Petersburg, Russia, May 26 – May 30, 2009. [pdf, 573 KB]
  • Axel Heim, Ulrich Sorger, and Florian Hug:
    “Doppler-variant modeling of the vocal tract”
    International Conference on Acoustics, Speech and Signal Processing (ICASSP), Las Vegas, Nevada, U.S.A., March 31 – April 04, 2008. [pdf, 221 KB]

Conference Papers

  • Irina Bocharova, Florian Hug, Rolf Johannesson, and Boris Kudryashov
    “LDPC codes with large girth based on voltage graphs”
    IEEE Information Theory Winter School, Barcelona, Spain, April 14 – April 18, 2011.
  • Florian Hug, and Nafiseh Seyed Mazloum:
    “Knowledge diversities and group dynamics within international master programs”,
    LTHs 6:e Pedagogiska inspirationskonferens 2010, Lund, December 15, 2010. [pdf, 70 KB]
  • Florian Hug:
    “Constructing error-correcting codes with huge distances”
    PRACE code porting workshop, Linköping, Sweden, October 13 – October 14, 2009.
  • Victor Zyablov, Florian Hug, and Rolf Johannesson:
    “A lower bound on the minimum distance of chained Gallager codes”
    IEEE Information Theory Winter School, Loen, Norway, March 29 – April 03, 2009.

Thesis

  • Florian Hug:
    “On Graph-Based Convolutional Codes”
    Diploma Thesis, Ulm University, Germany, March, 2008. [pdf 520 KB]
  • Florian Hug:
    “A time-varying model for representing the linear predictor coefficients in the
    Doppler domain”     Semester Thesis, Ulm University, Germany, June, 2007.
Go to Top