toppbild
Florian Hug
, PhD

Publikationer


Journal Articles

  1. 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)
  2. 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)
  3. 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)
  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. 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. D. Johnsson, F. Bjärkeson, M. Hell, F. Hug:
    Searching for new convolutional codes using the cell broadband engine architecture
    IEEE Communications Letters, Vol. 15, No. 5, pp. 560-562, 2011. (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)

Conference Papers (Peer reviewed)

  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. 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)
  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, 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)
  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. 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)
  8. F. Hug, F. Rusek:
    The BEAST for maximum-likelihood detection in non-coherent MIMO wireless systems
    International Conference on Communications (ICC), Cape Town, 2010-05-23/2010-05-27. (BibTeX) (More info)
  9. 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)
  10. 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)
  11. 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)
  12. A. Heim, U. Sorger, F. Hug:
    Doppler-variant modeling of the vocal tract
    International Conference on Acoustics, Speech and Signal Processing (ICASSP), Las Vegas, pp. 4197-4200, 2008-03-31/2008-04-04. (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. F. Hug, N. Seyed Mazloum:
    Knowledge diversities and group dynamics within international master programs
    LTHs 6:e Pedagogiska inspirationskonferens 2010, Lund, 2010-12-15. (BibTeX) (More info)
  3. 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)
  4. F. Hug:
    Constructing error-correcting codes with huge distances
    Partnership for Advanced Computing in Europe (PRACE) code porting workshop (invited talk), Linköping, 2009-10-13/2009-10-14. (BibTeX) (More info)

Dissertations

  1. F. Hug:
    Codes on Graphs and More
    Series of licentiate and doctoral dissertations, ISSN 1654-790X No. 38, 2012. (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