default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir B. Balakirsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c20]Martin A. Vinck
, Francesco P. Battaglia, Vladimir B. Balakirsky, A. J. Han Vinck, Cyriel M. A. Pennartz:
Estimation of the entropy on the basis of its polynomial representation. ISIT 2012: 1054-1058- [c19]Vladimir B. Balakirsky, A. J. Han Vinck:
Authentication over noisy data with the use of memory containing metric functions. ISIT 2012: 1977-1981 - 2011
- [j14]Vladimir B. Balakirsky, A. J. Han Vinck:
Performance of the verification for binary memoryless channels. Secur. Commun. Networks 4(10): 1212-1225 (2011) - [c18]Vladimir B. Balakirsky, A. J. Han Vinck:
Biometric Authentication Based on Significant Parameters. BIOID 2011: 13-24 - 2010
- [j13]Vladimir B. Balakirsky, A. J. Han Vinck:
A Simple Scheme for Constructing Fault-Tolerant Passwords from Biometric Data. EURASIP J. Inf. Secur. 2010 (2010) - [c17]Vladimir B. Balakirsky, A. J. Han Vinck:
Direct biometric verification schemes with Gaussian data. ISITA 2010: 48-53
2000 – 2009
- 2009
- [j12]Vladimir B. Balakirsky, Anahit R. Ghazaryan, A. J. Han Vinck:
Mathematical model for constructing passwords from biometrical data. Secur. Commun. Networks 2(1): 1-9 (2009) - [c16]Vladimir B. Balakirsky, Anahit R. Ghazaryan, A. J. Han Vinck:
Constructing Passwords from Biometrical Data. ICB 2009: 889-898 - [c15]Vladimir B. Balakirsky, Anahit R. Ghazaryan, A. J. Han Vinck:
Combinatorial data reduction algorithm and its applications to biometric verification. ISIT 2009: 2246-2250 - 2008
- [c14]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
- [c13]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 - [c12]Vladimir B. Balakirsky, Anahit R. Ghazaryan, A. J. Han Vinck:
Testing the Independence of Two Non-Stationary Random Processes with Applications to Biometric Authentication. ISIT 2007: 2671-2675 - 2006
- [c11]Vladimir B. Balakirsky, A. J. Han Vinck:
Coding Schemes for Data Transmission over Bus Systems. ISIT 2006: 1778-1782 - 2005
- [j11]Vladimir B. Balakirsky:
Hashing of Databases with the Use of Metric Properties of the Hamming Space. Comput. J. 48(1): 4-16 (2005) - 2004
- [c10]Sebastian Egner, Vladimir B. Balakirsky, Ludo Tolhuizen, Stan Baggen, Henk D. L. Hollmann:
On the entropy rate of a hidden Markov model. ISIT 2004: 12 - [c9]Vladimir B. Balakirsky, A. J. Han Vinck:
Achievable rates and decoding error probability for parallel channels with dependent noise and restricted number of active users. ISIT 2004: 480 - [c8]Vladimir B. Balakirsky:
Generating Functions Associated with Random Binary Sequences Consisting of Runs of Lengths 1 and 2. SETA 2004: 323-338 - 2003
- [j10]Vladimir B. Balakirsky, A. J. Han Vinck:
On the Performance of Permutation Codes for Multi-User Communication. Probl. Inf. Transm. 39(3): 239-254 (2003) - 2002
- [j9]Vladimir B. Balakirsky:
A New Coding Algorithm for TreesVladimir B. Balakirsky. Comput. J. 45(2): 237-242 (2002) - [j8]Vladimir B. Balakirsky:
Block Codes for Asynchronous Data Transmission Designed from Binary Trees. Comput. J. 45(2): 243-248 (2002) - [c7]Vladimir B. Balakirsky:
Estimates of the bit error probabilities for linear block codes and symmetric binary-input memoryless channels. ITW 2002: 175-178 - 2001
- [j7]Vladimir B. Balakirsky:
Joint Source-Channel Coding Using Variable-Length Codes. Probl. Inf. Transm. 37(1): 10-23 (2001) - [c6]Vladimir B. Balakirsky:
On Algebraic Soft Decision Decoding of Cyclic Binary Codes. AAECC 2001: 315-322 - [c5]Valeri Korjik, Guillermo Morales-Luna, Vladimir B. Balakirsky:
Privacy Amplification Theorem for Noisy Main Channel. ISC 2001: 18-26 - [c4]Vladimir B. Balakirsky, A. J. Han Vinck:
Constructions of specific permutation codes for multi-user communication. ITW 2001: 79-81 - [c3]Vladimir B. Balakirsky:
Description of Binary Sequences Based on the Interval Linear Complexity Profile. SETA 2001: 101-115
1990 – 1999
- 1999
- [j6]Rudolf Ahlswede, Vladimir B. Balakirsky:
Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel. IEEE Trans. Inf. Theory 45(1): 326-330 (1999) - 1998
- [j5]Vladimir B. Balakirsky:
Lower Bounds on the Code Rate for a Model of Data Transmission with Side Information. IEEE Trans. Inf. Theory 44(4): 1642-1648 (1998) - 1996
- [j4]Vladimir B. Balakirsky:
An upper bound on the distribution of computation of a sequential decoder for multiple-access channels. IEEE Trans. Inf. Theory 42(2): 399-408 (1996) - [j3]Vladimir B. Balakirsky:
Hashing of databases based on indirect observations of Hamming distances. IEEE Trans. Inf. Theory 42(2): 664-671 (1996) - [j2]Vladimir B. Balakirsky:
Estimations of the transfer functions of noncatastrophic convolutional encoders. IEEE Trans. Inf. Theory 42(3): 1014-1021 (1996) - 1995
- [j1]Vladimir B. Balakirsky:
A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels. IEEE Trans. Inf. Theory 41(6): 1889-1902 (1995) - 1993
- [c2]Vladimir B. Balakirsky:
A Necessary and Sufficient Condition for Time-Variant Convolutional Encoders to be Noncatastrophic. Algebraic Coding 1993: 1-10 - 1991
- [c1]Vladimir B. Balakirsky:
Coding Theorem for Discrete Memoryless Channels with Given Decision Rule. Algebraic Coding 1991: 142-150
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
