1. Balakirsky, Vladimir B.
    Constructing specific convolutional codes.
    Systems of Information Transmission vol.1(135), LIAP, Leningrad, pp.22-25, (1979) (in Russian).

  2. Balakirsky, Vladimir B.
    Estimation algorithms for Viterbi decoding error probabilities.
    Tekhnika sredstv svyazi ser. Tekhnika radiosvyazi no.5, pp.12-23, (1981) (in Russian).

  3. Balakirsky, Vladimir B.
    Sequential decoding algorithm in a multiple-access channel.
    Problems of Information Transmission vol.21, no.3, pp.3-13, (1985).
    English translation : Plenum Publishing Corporation, pp.163-172.

  4. Balakirsky, Vladimir B.
    Analysis of the Viterbi decoder by the methods of finite Markov chains.
    Tekhnika sredstv svyazi ser. Tekhnika radiosvyazi no.6, pp.42-51, (1985) (in Russian).

  5. Balakirsky, Vladimir B.
    The decoding error probability of the linear codes in the multiple access channels.
    Problems of Control and Information Theory vol.16, no.1, pp.29-40, (1987).

  6. Balakirsky, Vladimir B.
    Sequential decoding of linear convolutional codes.
    Problems of Information Transmission vol.23, no.4, pp.41-48, Oct.-Dec. (1987).
    English translation : Plenum Publishing Corporation, pp.281-287.

  7. Balakirsky, Vladimir B.
    Spectrum characteristics of variable-to-rate convolutional codes.
    NIIR Proceedings no.2, pp.27-33, (1988) (in Russian).

  8. Balakirsky, Vladimir B.; Kudryashov, Boris D.
    List decoding of convolutional codes.
    Problems of Information Transmission vol.25, no.1, pp.16-23, (1989).
    English translation : Plenum Publishing Corporation, pp.11-17.

  9. Balakirsky, Vladimir B.
    Asymptotic lower bound on the free distance of constant linear convolutional codes with rate 1/n.
    Problems of Information Transmission vol.26, no.3, pp.3-11, July-Sep. (1990).
    English translation : Plenum Publishing Corporation, pp.181-188.

  10. Balakirsky, Vladimir B.
    Sequential decoding algorithm producing the maximum-likelihood estimate for Gallager low density codes.
    Problems of Information Transmission vol.27, no.1, pp.50-60, (1991).
    English translation : Plenum Publishing Corporation, pp.40-48.

  11. Balakirsky, Vladimir B.
    Coding theorems for discrete memoryless channels with given decision rules.
    Lecture Notes in Computer Science, vol.573.
    Proc. 1st French-Soviet Workshop on Algebraic Coding, Paris, July.
    G.Cohen, S.Litsyn, A.Lobstein, and G.Zemor (ed),
    Berlin : Springer-Verlag, pp.142-150, (1991).

  12. Balakirsky, Vladimir B.
    A necessary and sufficient condition for time-variant convolutional encoders to be noncatastrophic.
    Lecture Notes in Computer Science, vol.781.
    Proc. 1st French-Israeli Workshop, Paris, (1993).
    Berlin : Springer-Verlag, pp.1-10, (1994).

  13. Balakirsky, Vladimir B.
    Transmission of constant weight binary sequences with convolutional codes and maximum likelihood decoding.
    Problems of Information Transmission vol.30, no.1, pp.70-84, (1994).
    English translation : Plenum Publishing Corporation, pp.60-71.

  14. Balakirsky, Vladimir B.
    A class of block codes and their decoding for transmission without synchronization.
    Proc. 1994 IEEE International Symposium on Information Theory Trondheim, Norway, p.64, (1994).

  15. Balakirsky, Vladimir B.; Nystr\"om, Johan
    Lower and upper bounds on the distribution of computation for sequential decoding of specific linear tree codes.
    Proc. 1994 IEEE International Workshop on Information Theory Moscow, Russia, pp.4-5, (1994).

  16. Balakirsky, Vladimir B.
    Hashing of databases based on indirect observations of Hamming distances.
    IEEE Trans.Inform.Theory vol.42, pp.664-671, (1996).
    SFB343 Diskrete Strukturen in der Mathematik Preprint 95-051, Bielefeld, (1995).

  17. Balakirsky, Vladimir B.
    A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels.
    IEEE Trans.Inform.Theory vol.41, pp.1889-1902, (1995).
    SFB343 Diskrete Strukturen in der Mathematik Preprint 95-100, Bielefeld, (1995).

  18. Balakirsky, Vladimir B.
    An upper bound on the distribution of computation of a sequential decoder for multiple-access channels.
    IEEE Trans.Inform.Theory vol.42, pp.399-408, (1996).

  19. Balakirsky, Vladimir B.
    Estimations of the transfer functions of noncatastrophic convolutional encoders.
    IEEE Trans.Inform.Theory vol.42, pp.1014-1021, (1996).

  20. Ahlswede, Rudolf; Balakirsky, Vladimir B.
    Identification under random processes.
    Problems of Information Transmission vol.32, no.1, pp.144-160, (1996).
    English translation : Plenum Publishing Corporation, pp.123-138, (1996).
    SFB343 Diskrete Strukturen in der Mathematik Preprint 95-098, Bielefeld (1995).

  21. Balakirsky, Vladimir B.
    On interval linear complexity of binary sequences.
    SFB343 Diskrete Strukturen in der Mathematik Preprint 97-014, Bielefeld, (1997).
    Abstract :
    Proc. IEEE International Symposium on Information Theory
    Whistler, British Columbia, Canada, p.490, Sep. (1995).

  22. Balakirsky, Vladimir B.; Korzhik, Valery I.; Kushnir, Dmitry V.
    Principles of quantum cryptography.
    Information Protection - Confident no.1(3), pp.43-51, (1995) (in Russian).

  23. Balakirsky, Vladimir B.
    Secrecy of electronic payments.
    Information Protection - Confident no.5(11), pp.47-53, (1996) (in Russian).

  24. Balakirsky, Vladimir B.
    Lower bounds on the code rate for a model of data transmission with side information.
    IEEE Trans.Inform.Theory vol.44, pp.1642-1648, (1998).
    SFB343 Diskrete Strukturen in der Mathematik Preprint 97-099, Bielefeld, (1997).

  25. Ahlswede, Rudolf; Balakirsky, Vladimir B.
    Construction of uniquely decodable codes for the two-user binary adder channel.
    IEEE Trans.Inform.Theory vol.45, pp.326-330, (1999).
    SFB343 Diskrete Strukturen in der Mathematik Preprint 97-016, Bielefeld, (1997).

  26. Balakirsky, Vladimir B.
    Coding for a model of random-access memories of a computer and write-unidirectional memories.
    SFB343 Diskrete Strukturen in der Mathematik Preprint 97-058, Bielefeld, (1997).

  27. Balakirsky, Vladimir B.
    Asymptotics of the maximal size of almost cancellative families of sets.
    Unpublished manuscript.

  28. Balakirsky, Vladimir B.
    Addition of integers in a computer memory : information theory approach
    Proc. 22-nd Symposium on Information Theory and Its Applications (SITA99),
    Echigo-Yuzawa, Japan, vol.1, pp. 415-418, (1999).

  29. Balakirsky, Vladimir B.
    A direct approach to searching with lies.
    Submitted to IEEE Trans.Inform.Theory July (1998).
    SFB343 Diskrete Strukturen in der Mathematik Preprint 98-070, Bielefeld, (1998).

  30. Balakirsky, Vladimir B.; Willems, Frans M. J.
    Nonasymptotic lower bound on the maximal cumulative redundancy of universal coding.
    Proc. 20-th Symposium on Information Theory in the Benelux,
    A. Barbe, E.C. van der Meulen, P. Vanroose (ed.). Haasrode, Belgium, pp.17-24, (1999).

  31. Balakirsky, Vladimir B.
    Characterization of the secrecy of a common key constructed via data transmission over the two-way AND channel.
    Proc. 20-th Symposium on Information Theory in the Benelux,
    A. Barbe, E.C. van der Meulen, P. Vanroose (ed.). Haasrode, Belgium, pp.87-94, (1999).

  32. Balakirsky, Vladimir B.
    Joint source-channel coding with variable length codes.
    Problems of Information Transmission vol.37, no.1, pp.12-27, (2001)
    English translation : pp.10-23.
    Abstract :
    Proc. 1997 IEEE International Symposium on Information Theory Ulm, Germany, p.491, (1997).

  33. Balakirsky, Vladimir B.
    On the structure of a common knowledge created by correlated observations and transmission over helping channels.
    Numbers, Information and Complexity, I. Althoefer, N. Cai, G. Dueck, L. Khachatrian, M. Pinsker, A. Sarkozy, I. Wegener, Z. Zhang (ed.),
    Kluwer Academic Publisher, pp.339-352 (2000).

  34. Balakirsky, Vladimir B.
    Addition of integers in a computer memory : Information theory approach.
    IEICE Transactions of Fundamentals of Electronics, Communications, and Computer Sciences vol. E83-A, no. 10, pp.1929-1935, (2000).

  35. Balakirsky, Vladimir B.
    An upper bound on the expected number of computations for maximum likelihood decoding of low-density codes.
    Proc. 21-st Symposium on Information Theory in the Benelux, J. Biemond (ed.). Wassenaar, The Netherlands, pp.285-292, (2000).

  36. Balakirsky, Vladimir B.
    The minimum number of questions in searching with one lie and delay in one answer.
    Proc. 7-th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT'2000), Bansko, Bulgaria, pp.61-64, (2000).

  37. Balakirsky, Vladimir B.
    Strategy for data transmission over binary channels with noiseless feedback and upper bound on the number of questions in searching with lies.
    Proc. IEEE International Symposium on Information Theory, Sorrento, Italy, p.376, (2000).

  38. Balakirsky, Vladimir B.
    A graph-theoretic approach to searching with lies.
    Proc. Conference on Search and Communication Complexity, Balatonlelle, Hungary, pp.1-2, (2000).

  39. Balakirsky, Vladimir B.; Willems, Frans M. J.
    Sequential decoding algorithm for low-density codes and symmetric memoryless channels.
    Proc. ISITA'2000, Honolulu, Hawaii, U.S.A., vol.1, pp.176-179, (2000).

  40. Balakirsky, Vladimir B.
    Description of binary sequences based on the interval linear complexity profile.
    Accepted for publication in the Lecture Notes in Computer Science
    Abstract :
    Proc. SETA'2001, Bergen, Norway, pp.13-14, (2001).

  41. Balakirsky, Vladimir B.
    Block codes for asynchronous data transmission over a noiseless q-ary channel
    Proc. 6-th International Symposium on Communication Theory and Applications, Ambleside, UK, pp.449-454 (2001).

  42. Balakirsky, Vladimir B.; Han Vinck, A. J.
    Constructions of permutation codes for multi-user communication.
    Proc. 2001 IEEE Information Theory Workshop, Cairns, Australia, pp.79-81, (2001).
    On the performance of permutation codes for multi-user communication.
    Proc. 2002 International Symposium on Information Theory, Lousanne, Switzerland, p.307, (2002).

  43. Balakirsky, Vladimir B.; Korjik, Valeri I.; Morales-Luna, Guillermo
    Privacy amplification theorem for noisy main channel.
    Lecture Notes in Computer Science, vol. 2200. Information Security : 4th International conference; proceedings / ISC 2001,
    Malaga, Spain, Oct. 1-3, G. I. Davida, Y. Frankel (ed.).
    Berlin : Springer-Verlag, ISBN 3-540-42662-0, pp. 18-26, (2001).

  44. Balakirsky, Vladimir B.
    Recursive decoding procedures for minimizing the bit error probability for block and convolutional codes.
    Proc. Mini-Workshop on Convolutional Codes, A. J. Han Vinck (ed.), ISBN: 3-9807929-0-0, Essen, Germany, pp.31-45, (2001).

  45. Balakirsky, Vladimir B.
    On algebraic soft decision decoding of cyclic binary codes.
    Lecture Notes in Computer Science : Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 14-th International Symposium, AAECC-14, vol. 2227, ISBN 3-540-42911-5, Melbourne, Australia, S. Bostas, I. E. Shparlinski (ed.), pp. 315-322, (2001).
    Slides.

  46. Balakirsky, Vladimir B.
    A new coding algorithm for trees.
    The Computer Journal, vol. 45, no. 2, pp.237-242, (2002).

  47. Balakirsky, Vladimir B.
    Block codes for asynchronous data transmission designed from binary trees.
    The Computer Journal, vol. 45, no. 2, pp.243-248, (2002).

  48. Balakirsky, Vladimir B.; Han Vinck, A. J.
    Communication over time--varying channels under power constraints and side information of the participants.
    Proc. 6-th Int. Symposium on Power-Line Communications and Its Applications (ISPLC'2002),
    F-N. Pavlidou (ed.), Athens, Greece, pp.106-110, (2002).
    Slides.

  49. Balakirsky, Vladimir B.
    Algorithm for computing the similarity between binary vectors.
    Proc. 8-th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT'8),
    Tsarskoe Selo, Russia, pp.22-25 (2002).

  50. Balakirsky, Vladimir B.
    Estimates of the bit error probabilities for binary linear block codes and symmetric binary-input memoryless channels.
    Proc. International Workshop on Information Theory (IWIT'02),
    Bangalore, India, pp. 175-178 (2002).

  51. Balakirsky, Vladimir B.
    Suboptimum algorithm for estimating transmitted code bits for binary linear block codes and symmetric memoryless channels.
    Unpublished manuscript (2002).

  52. Balakirsky, Vladimir B.; Han Vinck, A. J.
    Potential limits on power-line communication over impulsive noise channels.
    Proc. 7-th Int. Symposium on Power-Line Communications and Its Applications (ISPLC'2003),
    Y. Morihiro, A. J. Han Vinck (eds.), Kyoto, Japan, pp. 32-37, (2003).

  53. Balakirsky, Vladimir B.; Baggen E. P. E. M.
    An efficient algorithm for computing the entropy of output sequences for bitshift channels.
    Proc. 24-th Int. Symposium on Information Theory in the Benelux,
    L. M. G. M. Tolhuizen (ed.), Veldhoven, The Netherlands, pp. 157-164 (2003).

  54. Balakirsky, Vladimir B.
    Hashing of databases with dense structure.
    Proc. 7-th Int. Symposium on Communication Theory and Applications,
    Ambleside, UK, pp. 233-238 (2003).


For any questions and problems with this web site please email to cdeppe@Mathematik.Uni-Bielefeld.DE. Last change: 24/07/2003