Search the dblp DataBase

Publications of Author

1. Vladimir B. Balakirsky
   On Algebraic Soft Decision Decoding of Cyclic Binary Codes. [Citation Graph (0, 0)][DBLP]
   AAECC, 2001, pp:315-322 [Conf]
   
2. Vladimir B. Balakirsky
   Coding Theorem for Discrete Memoryless Channels with Given Decision Rule. [Citation Graph (0, 0)][DBLP]
   Algebraic Coding, 1991, pp:142-150 [Conf]
   
3. Vladimir B. Balakirsky
   A Necessary and Sufficient Condition for Time-Variant Convolutional Encoders to be Noncatastrophic. [Citation Graph (0, 0)][DBLP]
   Algebraic Coding, 1993, pp:1-10 [Conf]
   
4. Valeri Korjik, Guillermo Morales-Luna, Vladimir B. Balakirsky
   Privacy Amplification Theorem for Noisy Main Channel. [Citation Graph (0, 0)][DBLP]
   ISC, 2001, pp:18-26 [Conf]
   
5. Vladimir B. Balakirsky
   Generating Functions Associated with Random Binary Sequences Consisting of Runs of Lengths 1 and 2. [Citation Graph (0, 0)][DBLP]
   SETA, 2004, pp:323-338 [Conf]
   
6. Vladimir B. Balakirsky
   A New Coding Algorithm for TreesVladimir B. Balakirsky. [Citation Graph (0, 0)][DBLP]
   Comput. J., 2002, v:45, n:2, pp:237-242 [Journal]
   
7. Vladimir B. Balakirsky
   Block Codes for Asynchronous Data Transmission Designed from Binary Trees. [Citation Graph (0, 0)][DBLP]
   Comput. J., 2002, v:45, n:2, pp:243-248 [Journal]
   
8. Vladimir B. Balakirsky
   Hashing of Databases with the Use of Metric Properties of the Hamming Space. [Citation Graph (0, 0)][DBLP]
   Comput. J., 2005, v:48, n:1, pp:4-16 [Journal]
   
9. Rudolf Ahlswede, Vladimir B. Balakirsky
   Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:326-330 [Journal]
   
10. Vladimir B. Balakirsky
    A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1889-1902 [Journal]
    
11. Vladimir B. Balakirsky
    An upper bound on the distribution of computation of a sequential decoder for multiple-access channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:2, pp:399-408 [Journal]
    
12. Vladimir B. Balakirsky
    Hashing of databases based on indirect observations of Hamming distances. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:2, pp:664-671 [Journal]
    
13. Vladimir B. Balakirsky
    Estimations of the transfer functions of noncatastrophic convolutional encoders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:1014-1021 [Journal]
    
14. Vladimir B. Balakirsky
    Lower Bounds on the Code Rate for a Model of Data Transmission with Side Information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:4, pp:1642-1648 [Journal]
    
15. Vladimir B. Balakirsky, Anahit R. Ghazaryan, A. J. Han Vinck
    An Algorithm for Biometric Authentication Based on the Model of Non-Stationary Random Processes. [Citation Graph (0, 0)][DBLP]
    ICB, 2007, pp:319-327 [Conf]
    
16. 
    Constructing Passwords from Biometrical Data. [Citation Graph (, )][DBLP]
    
    
17. 
    Additive Block Coding Schemes for Biometric Authentication with the DNA Data. [Citation Graph (, )][DBLP]