Vladimir B. Balakirsky - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 34 from 34

2012

Authentication over noisy data with the use of memory containing metric functionsVladimir B. Balakirsky, A. J. Han Vinck. isit 2012: 1977-1981 [doi]

Estimation of the entropy on the basis of its polynomial representationMartin Vinck, Francesco Paolo Battaglia, Vladimir B. Balakirsky, A. J. Han Vinck, Cyriel M. A. Pennartz. isit 2012: 1054-1058 [doi]

2011

Performance of the verification for binary memoryless channelsVladimir B. Balakirsky, A. J. Han Vinck. scn, 4(10):1212-1225, 2011. [doi]

Biometric Authentication Based on Significant ParametersVladimir B. Balakirsky, A. J. Han Vinck. bioid 2011: 13-24 [doi]

2010

A Simple Scheme for Constructing Fault-Tolerant Passwords from Biometric DataVladimir B. Balakirsky, A. J. Han Vinck. ejisec, 2010, 2010. [doi]

Direct biometric verification schemes with Gaussian dataVladimir B. Balakirsky, A. J. Han Vinck. isita 2010: 48-53 [doi]

2009

Mathematical model for constructing passwords from biometrical dataVladimir B. Balakirsky, Anahit R. Ghazaryan, A. J. Han Vinck. scn, 2(1):1-9, 2009. [doi]

Combinatorial data reduction algorithm and its applications to biometric verificationVladimir B. Balakirsky, Anahit R. Ghazaryan, A. J. Han Vinck. isit 2009: 2246-2250 [doi]

Constructing Passwords from Biometrical DataVladimir B. Balakirsky, Anahit R. Ghazaryan, A. J. Han Vinck. icb 2009: 889-898 [doi]

2008

Additive Block Coding Schemes for Biometric Authentication with the DNA DataVladimir B. Balakirsky, Anahit R. Ghazaryan, A. J. Han Vinck. bioid 2008: 160-169 [doi]

2007

An Algorithm for Biometric Authentication Based on the Model of Non-Stationary Random ProcessesVladimir B. Balakirsky, Anahit R. Ghazaryan, A. J. Han Vinck. icb 2007: 319-327 [doi]

Testing the Independence of Two Non-Stationary Random Processes with Applications to Biometric AuthenticationVladimir B. Balakirsky, Anahit R. Ghazaryan, A. J. Han Vinck. isit 2007: 2671-2675 [doi]

2006

Coding Schemes for Data Transmission over Bus SystemsVladimir B. Balakirsky, A. J. Han Vinck. isit 2006: 1778-1782 [doi]

2005

Hashing of Databases with the Use of Metric Properties of the Hamming SpaceVladimir B. Balakirsky. cj, 48(1):4-16, 2005. [doi]

2004

Generating Functions Associated with Random Binary Sequences Consisting of Runs of Lengths 1 and 2Vladimir B. Balakirsky. seta 2005: 323-338 [doi]

Achievable rates and decoding error probability for parallel channels with dependent noise and restricted number of active usersVladimir B. Balakirsky, A. J. Han Vinck. isit 2004: 480 [doi]

On the entropy rate of a hidden Markov modelSebastian Egner, Vladimir B. Balakirsky, Ludo Tolhuizen, Stan Baggen, Henk D. L. Hollmann. isit 2004: 12 [doi]

2003

On the Performance of Permutation Codes for Multi-User CommunicationVladimir B. Balakirsky, A. J. Han Vinck. poit, 39(3):239-254, 2003. [doi]

2002

Block Codes for Asynchronous Data Transmission Designed from Binary TreesVladimir B. Balakirsky. cj, 45(2):243-248, 2002. [doi]

A New Coding Algorithm for TreesVladimir B. BalakirskyVladimir B. Balakirsky. cj, 45(2):237-242, 2002. [doi]

Estimates of the bit error probabilities for linear block codes and symmetric binary-input memoryless channelsVladimir B. Balakirsky. itw 2002: 175-178 [doi]

2001

1999

Construction of Uniquely Decodable Codes for the Two-User Binary Adder ChannelRudolf Ahlswede, Vladimir B. Balakirsky. TIT, 45(1):326-330, 1999.

1998

Lower Bounds on the Code Rate for a Model of Data Transmission with Side InformationVladimir B. Balakirsky. TIT, 44(4):1642-1648, 1998.

1996

Estimations of the transfer functions of noncatastrophic convolutional encodersVladimir B. Balakirsky. TIT, 42(3):1014-1021, 1996.

Hashing of databases based on indirect observations of Hamming distancesVladimir B. Balakirsky. TIT, 42(2):664-671, 1996.

An upper bound on the distribution of computation of a sequential decoder for multiple-access channelsVladimir B. Balakirsky. TIT, 42(2):399-408, 1996.

1995

A converse coding theorem for mismatched decoding at the output of binary-input memoryless channelsVladimir B. Balakirsky. TIT, 41(6):1889-1902, 1995.

1993

A Necessary and Sufficient Condition for Time-Variant Convolutional Encoders to be NoncatastrophicVladimir B. Balakirsky. fiwac 1993: 1-10

1991

Coding Theorem for Discrete Memoryless Channels with Given Decision RuleVladimir B. Balakirsky. fiwac 1992: 142-150

Sign in or sign up to see more results.

runs on WebDSL