95-051   V. B. Balakirsky                                    
         Hashing of Data Bases Based on Indirect
         Observations of Hamming Distances
         IEEE Trans.Inform.Theory, vol.42, pp.664-671, Mar. 1996

95-098   Rudolf Ahlswede, Vladimir B. Balakirsky
         Identification under Random Processes
         Problemy Peredachi Informatsii vol.32, pp.144-160, 
         Jan.-Mar. 1996 (in Russian)


95-100   V. B. Balakirsky                                    
         A Converse Coding Theorem for Mismatched Decoding
         at the Output of Binary-Input Memoryless Channels
         IEEE Trans.Inform.Theory, vol.41, pp.1889-1902, Nov. 1995


97-014   Vladimir B. Balakirsky
         On Interval Linear Complexity of Binary Sequences

97-016   Rudolf Ahlswede, Vladimir B. Balakirsky
         Construction of Uniquely Decodable Codes for the
            Two-User Binary Adder Channel


97-058   Vladimir B. Balakirsky
         Coding for a Model of Random-Access Memories of a 
         Computer and Write-Unidirectional Memories


97-099   Vladimir B. Balakirsky
         Lower Bounds on the Code Rate for a Model of Data 
         Transmission with Side Information


98-070   Vladimir B. Balakirsky
         A direct approach to searching with lies
         



icon Hauptseite
icon main site
 
For any questions and problems with this web site please email to cdeppe@Mathematik.Uni-Bielefeld.DE. Last change: 12/10/1998