U. Vazirani
- Al.N. Alon, 'On VV-s result SRP = RP," unpublished manuscript, May 1985.Google Scholar
- Bl.M. Blum, "Independent Unbiased Coin Flips From a Correlated Biased Source: a Finite State Markov Chain," 25th. IEEE Symposium on the Foundations of Computer Science, 1984.Google Scholar
- CG.B. Chor and O. Goldreich, "Unbiased Bits from Weak Sources of Randomness," 26th. IEEE Symposium on the Foundations of Computer Science, 1985.Google Scholar
- El.P. Elias, "The Efficient Construction of an Unbiased Random Sequence," Ann. Math. Statist. Vol 43, No. 3, 1972, 865-870.Google ScholarCross Ref
- Ga.R. Gallager, Information Theory and Reliable Communication, New York: John Wiley, 1968. Google ScholarDigital Library
- Ho.C. Hooley, 'iDn Artin's Conjecture," CreUe's Journal, 225, (1967), pp 209-220.Google Scholar
- Ju.J. Justesen, "A Class of Constructive Asymptotically Good Algebraic Codes,*' IEEE Trans. Inform. Theory, vol IT-18, pp 652-656, Sept Google ScholarDigital Library
- vN.J. yon Neumann, "Various Techniques Used in Connection with Random Digits," Notes by G. E. For sythe, National Bureau of' Standards, Applied Math Series, 1951, Vol 12, 36-38. Reprinted in yon Neumann's Collected Works, Vol 5, Pergamon Press (1963), 768- 770.Google Scholar
- SV.M. Santha and U. V. Vazirani, 'Generating Quasi-random Sequences from Semi-random Sources," journal of Computer Systems and Sciences, Vol. 33, No 1, Aug 1986, pp 75-87. Google ScholarDigital Library
- Sh.D. Shanks, Solved and Unsolved Problems in Number Theory, Chelsea Publishing Co., NY. Google ScholarDigital Library
- Va.U.V. Vazirani, 'Towards a Strong Communication Complexity Theory or Generating Quasi-random sequences from two communicating semi-random sources," 15th Annual ACM Syrup. on Theory of Computing, pp 366- 378, 1983. Google ScholarDigital Library
- Va2.U.V. Vazirani, '~Randomness, Adversaries and Computation," Ph.D. Dissertation, U. C. Berkeley, 1986. Google ScholarDigital Library
- VV1.U.V. Vazirani and V. V. Vazirani, "'Random Polynomial Time is Equal to Semi-Random Polynomial Time," 26th. {EEE Symposium on the Foundations of Computer Science, 1985.Google Scholar
- VV2.U.V. Vazirani and V.V. Vazirani, "Sampling a Population with a Semi-random source," Proceedings Sixth Ann. FST-TCS Conference, New Delhi, 1986. Google ScholarDigital Library
- Wy.A. Wyner, '~Wire-tap Channel," Bell System Technical Journal, pp 1355-1387, Oct. 1975.Google Scholar
- Ya2.A. Yao, 'ff'heory and Applications of Trapdoor Functions," 23th. IEEE Symposium on the Foundations of Computer Science, 1982.Google Scholar
Index Terms
- Efficiency considerations in using semi-random sources
Recommendations
MAP decoding for multi-antenna systems with non-uniform sources: exact pairwise error probability and applications
We study the maximum a posteriori (MAP) decoding of memoryless non-uniform sources over multiple-antenna channels. Our model is general enough to include space-time coding, BLAST architectures, and single-transmit multireceive antenna systems which ...
Joint source-channel turbo coding for binary Markov sources
We investigate the construction of joint source-channel (JSC) turbo codes for the reliable communication of binary Markov sources over additive white Gaussian noise and Rayleigh fading channels. To exploit the source Markovian redundancy, the first ...
Distributed source coding using raptor codes for hidden Markov sources
In this correspondence, the problem of distributed source coding (DSC) of binary sources with side information at the decoder is addressed. A scheme is proposed based on raptor codes which are a new class of rateless codes. The decoding scheme is ...
Comments