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