Vladimir B. Balakirsky

According to our database1, Vladimir B. Balakirsky authored at least 34 papers between 1991 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
Estimation of the entropy on the basis of its polynomial representation.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Authentication over noisy data with the use of memory containing metric functions.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Performance of the verification for binary memoryless channels.
Secur. Commun. Networks, 2011

Biometric Authentication Based on Significant Parameters.
Proceedings of the Biometrics and ID Management, 2011

2010
A Simple Scheme for Constructing Fault-Tolerant Passwords from Biometric Data.
EURASIP J. Inf. Secur., 2010

Direct biometric verification schemes with Gaussian data.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

2009
Mathematical model for constructing passwords from biometrical data.
Secur. Commun. Networks, 2009

Combinatorial data reduction algorithm and its applications to biometric verification.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Constructing Passwords from Biometrical Data.
Proceedings of the Advances in Biometrics, Third International Conference, 2009

2008
Additive Block Coding Schemes for Biometric Authentication with the DNA Data.
Proceedings of the Biometrics and Identity Management, First European Workshop, 2008

2007
Testing the Independence of Two Non-Stationary Random Processes with Applications to Biometric Authentication.
Proceedings of the IEEE International Symposium on Information Theory, 2007

An Algorithm for Biometric Authentication Based on the Model of Non-Stationary Random Processes.
Proceedings of the Advances in Biometrics, International Conference, 2007

2006
Coding Schemes for Data Transmission over Bus Systems.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Hashing of Databases with the Use of Metric Properties of the Hamming Space.
Comput. J., 2005

2004
Generating Functions Associated with Random Binary Sequences Consisting of Runs of Lengths 1 and 2.
Proceedings of the Sequences and Their Applications, 2004

On the entropy rate of a hidden Markov model.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Achievable rates and decoding error probability for parallel channels with dependent noise and restricted number of active users.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
On the Performance of Permutation Codes for Multi-User Communication.
Probl. Inf. Transm., 2003

2002
Block Codes for Asynchronous Data Transmission Designed from Binary Trees.
Comput. J., 2002

A New Coding Algorithm for TreesVladimir B. Balakirsky.
Comput. J., 2002

Estimates of the bit error probabilities for linear block codes and symmetric binary-input memoryless channels.
Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001
Joint Source-Channel Coding Using Variable-Length Codes.
Probl. Inf. Transm., 2001

Description of Binary Sequences Based on the Interval Linear Complexity Profile.
Proceedings of the Sequences and their Applications, 2001

Constructions of specific permutation codes for multi-user communication.
Proceedings of the 2001 IEEE Information Theory Workshop, 2001

Privacy Amplification Theorem for Noisy Main Channel.
Proceedings of the Information Security, 4th International Conference, 2001

On Algebraic Soft Decision Decoding of Cyclic Binary Codes.
Proceedings of the Applied Algebra, 2001

1999
Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel.
IEEE Trans. Inf. Theory, 1999

1998
Lower Bounds on the Code Rate for a Model of Data Transmission with Side Information.
IEEE Trans. Inf. Theory, 1998

1996
Estimations of the transfer functions of noncatastrophic convolutional encoders.
IEEE Trans. Inf. Theory, 1996

Hashing of databases based on indirect observations of Hamming distances.
IEEE Trans. Inf. Theory, 1996

An upper bound on the distribution of computation of a sequential decoder for multiple-access channels.
IEEE Trans. Inf. Theory, 1996

1995
A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels.
IEEE Trans. Inf. Theory, 1995

1993
A Necessary and Sufficient Condition for Time-Variant Convolutional Encoders to be Noncatastrophic.
Proceedings of the Algebraic Coding, 1993

1991
Coding Theorem for Discrete Memoryless Channels with Given Decision Rule.
Proceedings of the Algebraic Coding, 1991


  Loading...