Binarizations in Random Number Generation
- Authors
- Pae, Sung-il
- Issue Date
- 2016
- Publisher
- IEEE
- Citation
- 2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, pp.2923 - 2927
- Journal Title
- 2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY
- Start Page
- 2923
- End Page
- 2927
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/28203
- Abstract
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/28203)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.