Bounds on fixed-length post-processing functions for stationary biased random number generators

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

We investigate post-processing functions with fixedlength inputs/outputs for reducing biases of random bits. When original random bits are i.i.d., biases of the post-processed sequences are polynomials in bias of the original bits, and a function is regarded as better if least degrees of those polynomials are larger. In this article we give upper and lower bounds of the optimal least degree for such post-processing functions, and in some cases determine the optimal degree precisely.

本文言語英語
ホスト出版物のタイトル2008 International Symposium on Information Theory and its Applications, ISITA2008
DOI
出版ステータス出版済み - 2008
外部発表はい
イベント2008 International Symposium on Information Theory and its Applications, ISITA2008 - Auckland, ニュージ―ランド
継続期間: 12 7 200812 10 2008

出版物シリーズ

名前2008 International Symposium on Information Theory and its Applications, ISITA2008

会議

会議2008 International Symposium on Information Theory and its Applications, ISITA2008
国/地域ニュージ―ランド
CityAuckland
Period12/7/0812/10/08

All Science Journal Classification (ASJC) codes

  • コンピュータ サイエンス(全般)

フィンガープリント

「Bounds on fixed-length post-processing functions for stationary biased random number generators」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル