next up previous
Next: About this document

Workshop Report: Seventh Joint Swedish-Russian International Workshop on Information Theory

Vladimir Sidorenko

The Seventh Joint Swedish-Russian International Workshop on Information Theory was held June 17-22, 1995, in The Education Center ``Lahta'', St. Petersburg, Russia.

The Workshop is part of the effort at scientific cooperation between the Swedish Universities of Linköping and Lund, and the Institute for Problems of Information Transmission in Moscow. This effort is based on an agreement regarding scientific and technical cooperation between the Russian Academy of Sciences, the Royal Swedish Academy of Sciences, and the Royal Swedish Academy of Engineering Sciences. The Workshop is also one of the activities the Russian Chapter of IEEE Information Theory Society.

Financial support from the Russian Ministry of Science and the Russian Foundation for Fundamental Research is gratefully acknowledged. Previous workshops were held in Sochi, USSR (1983), Gränna, Sweden (1985), Sochi, USSR (1987), Gotland, Sweden (1989), Moscow, Russia (1991), and Mölle, Sweden (1993).

The workshop was attended by more than 80 participants. Their countries of origin (with the number of participants in parentheses) included Russia (49), Sweden (20), the United States (4), Germany (3), the United Kingdom (2), Armenia (2), and Japan (1).

The technical program consisted of eight sessions covering a broad spectrum of topics: Block Codes, Information Theory, Construction of Convolutional Codes, Information Protection, Decoding Problems, Multi-Step Decoding, Multiple-Access Systems, and Source Coding. The technical sessions were well received, with often lively discussion following many of the presentations. The Proceedings were published.

The cultural program included tours of architecture, museums, and old Russian estates in St. Petersburg. One of St. Petersburg's best jazz bands gave a concert. Viewing the above picture from the banquet, one can also see that several well known Soviet leaders came to deliver greetings at the Workshop.

The response of the Workshop participants to the technical and social programs appeared to be positive, and it is certain that the field of Information Theory will benefit from the many new professional interactions stimulated by this event.

LIST OF TALKS

Block Codes: Chairman - K.Sh. Zigangirov

  • T. Ericson and V. Zinoviev, ``Spherical codes from lattices''
  • E. Krouk and S. Semenov, ``On the existence of good quasi-cyclic codes''
  • S. Bezzateev and N. Shekhunova, ``On subcodes of one class of quasi-cyclic Goppa codes''
  • I.M. Boyarinov, ``Totally self-checking decoders with test delay for shortened Hamming SEC codes''
  • A. Ashikhmin, ``On generalized Hamming weights for Galois ring-linear codes''
  • M. Olofsson, ``On matrix representations of finite extension fields''
  • I.V. Pertsev, ``New algorithms of memory allocation enhancing the arithmetic code efficiency''
  • F.A. Taubin, ``Multilevel time-frequency coding for fading dispersive channels''
  • A.G. D'yachkov, ``On the list decoding of linear codes''
  • Information Theory: Chairman - R. Johannesson

  • M.S. Pinsker and V.V. Prelov, ``Sensitivity of optimal filtering to a weak non-Gaussian noise''
  • L.A. Bassalygo and M.V. Burnashev, ``On maximal number of almost orthogonal measures on finite set''
  • S.W. Golomb, ``Roots of polynomials corresponding to generalized Barker sequences
  • V.Yu. Krachkovsky, ``On asymptotical upper bounds on the rate of constrained codes''
  • J. Justesen and Y.M. Shtarkov, ``Combinatorial entropy of discrete images''
  • V.N. Koshelev, ``A scheme of indirect measurements based on triangle inequality''
  • Yu.L. Sagalovich and V.Yu. Solomennikov, ``New separating systems''
  • B. Troyanovsky and A. Trofimov, ``Trellis encoding of sequences of uniformly low weight and its application to speech compression''
  • Construction of Convolutional Codes: Chairman - P.G. Farrell

  • I.E. Bocharova and B.D. Kudryashov, ``New constructions of punctured convolutional codes for soft-decision Viterbi decoding''
  • R. Johannesson, K.Sh. Zigangirov and V.V.Zyablov, ``Lower bounds on the free distance for random concatenated convolutional codes''
  • S. Höst, R. Johannesson, and V.V. Zyablov, ``On the construction of concatenated codes based on binary conventional convolutional codes''
  • J. Maucher, ``A new construction of (partial) unit memory codes based on Reed Muller codes''
  • Information Protection: Chairman - B. Honary

  • L.-I. Alfredsson, ``A mirrored integer sequence of length and the discrete logarithm in Fermat prime fields''
  • C. Gehrmann, ``Remarks on the theoretical treatments of secrecy systems''
  • T. Johansson, ``Authentication codes protecting against collusion attacks''
  • B.Ya. Ryabko, ``Efficient randomization of messages in the cryptographic systems''
  • Decoding Problems: Chairman - S.B. Wicker

  • J. Eiguren, I.I. Dumer, and P.G. Farrell, ``Soft-decision decoding algorithms for linear block codes''
  • V. Sidorenko, G. Markarian, and B. Honary, ``Code trellises and the Shannon product''
  • B. Honary, ``Trellis derived block coded modulation''
  • G. Markarian and B. Honary, ``Trellis decoding of block codes in (1-D) partial response channels''
  • M. Bossert and V.V. Zyablov, ``When and why erasures are good for Gaussian channel''
  • G. Bratt, R. Johannesson, and K.Sh. Zigangirov, ``Bounds on the number of computations of sequential decoding for the Gilbert-Elliott channel''
  • P. Ljungberg, ``Sequential decoding of trellis codes - performance limits and simulations''
  • V.M. Sidelnikov and A.Ya. Dorofeev, ``Decoding second-order Reed-Muller codes in the presence of errors''
  • Multi-Step Decoding: Chairman - B.D. Kudryashov

  • J. Hagenauer and V. Kolesnik, ``On a'posteriori stabilization and multi-step decoding''
  • V. Kolesnik and A. Trofimov, ``Multistep soft output decoding for iterative convolutional codes'' S. Fedorenko and V. Kolesnik, ``Multi-step decoding of iterated Hamming codes''
  • X. Wang and S.B. Wicker, ``The generation of efficient soft outputs in Viterbi decoding'' S.I. Kovalev, ``An improved decoding procedure for iterative codes''
  • Multiple-Access Systems: Chairman - T. Ericson

  • L. Wilhelmsson and K.Sh. Zigangirov, ``On the capacity for the noiseless T-user q-ary multiple-access channel''
  • V.V. Chepyzhov, S.A. Popov, and D.K. Zigangirov, ``Implementation and some applications of the algebraic-sequential decoder''
  • S. Hjelm, ``Bounds on the erasure probability for a simple anti-jamming system with slow frequency hopping''
  • K. Hovakimian and P. Kempf, ``Modified interference cancelation algorithm for multiuser detection in a DS/CDMA system''
  • B. Rimoldi, ``RDMA for multipath multiple access channels: an optimum asynchronous low complexity technique''
  • V.B. Afanassiev and G. Lindh, ``A new algorithm for decoding of Plotkin structure (a,a+b)''
  • N.D. Vvedenskaya, ``Message delay in a network with many multiple routes and feedback''
  • N.D. Vvedenskaya, ``Performance of stack-algorithm with 'success/no success' feedback''
  • Source Coding: Chairman - B.Ya. Ryabko

  • I.E. Bocharova and B.D. Kudryashov, ``Fast exponentiation based on data compression algorithms''
  • Te Sun Han, ``The strong converse for source coding with a fidelity criterion''
  • Yu.M. Shtarkov, ``About Cleary-Witten algorithm''
  • Yu.M. Shtarkov and D.N. Zotkin, ``Experimental study of some Cleary-Witten algorithm modifications''
  • M.M. Lange, ``On identification problem for trees''


  • next up previous
    Next: About this document

    Ramesh Rao
    Wed Apr 10 16:29:27 PDT 1996