상세 보기
초록
Extracting procedures produce unbiased random bits from biased coin flips. Binarizations take inputs from an m-faced dice and produce bit sequences to be fed into a (binary) extracting procedure to obtain random bits, and this can be done in an entropy-preserving manner, without loss of information. Such a procedure has been proposed by Zhou and Bruck [1]. We discuss a family of such entropy-preserving processes that we call complete binarizations.
- 제목
- Binarizations in Random Number Generation
- 저자
- Pae, Sung-il
- 발행일
- 2016
- 유형
- Proceedings Paper
- 저널명
- 2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY
- 페이지
- 2923 ~ 2927
- 언어
- ENG
- 출판사
- IEEE
- 발행국가
- 미국
- 분량
- 5 페이지