Information Technology Reference
In-Depth Information
The main open problem is to design both constructive and effective error correc-
tion procedures for the specific channel model when check symbol are transmitted
over noiseless channel but information symbols are transmitted over BSC. One of
candidates to solve this problem is so called
dichotomic search procedure
when legal
users compare the parities of blocks and subblocks until they are able to find the error
bit and remove it. This algorithm is very simple but firstly it is not very effective and
secondly it does not satisfy the conditions of
EPAT
and therefore it requires further
investigations.
References
1. Ahlswede, R., Csiszar, I.: Common Randomness in Information Theory and Cryptography-
Part 1: Secret Sharing. IEEE Trans. on IT, Vol. 39, no 4 (1993) 1121-1132
2. Maurer, U.: Secret Key Agreement by Public Discussion Based on Common Information.
IEEE Trans. on IT, Vol. 39, no 3 (1993) 733-742
3. Berrou, C.: Near Optimum Error Correcting Coding and Decoding: Turbo Codes. IEEE
Trans on Communication, Vol. 44, no 10 (1996) 1261-1271
4. Yakovlev, V., Korjik, V., Sinuk, A.: Key Distribution Protokol Based on Noisy Channel and
Error Detecting Codes. Lecture Notes in Computer Science, Vol. 2052, Springer-Verlag
(2001) 242-250
5. Korjik, V., Morales Luna, G., Balakirsky, V.: Privacy Amplification Theorem for Noisy
Main Channel. Lecture Notes in Computer Science, Vol. 2200, Springer-Verlag, (2002) 18-
26
6. Bennett, C., Brassard, G., Crepeau, C., Maurer U.: Generalized Privacy Amplification .
IEEE Trans. on Inform. Theory. Vol. 4, no 6 (1995) 1915-1923
7. Cachin, C. Smooth Entropy and Renyi Entropy. Lecture Notes in Computer Science, Vol.
1233, Springer-Verlag (1997) 193-208
8. Yakovlev, V.: Personal communication (1999)
