Extractors for the Real World

dc.creatorXue,Kundi
dc.creatorZimand,Marius
dc.date2000
dc.date.accessioned2024-02-06T12:50:29Z
dc.date.available2024-02-06T12:50:29Z
dc.descriptionExtractors are a special type of binary graphs that can be utilized to improve the quality of randomness sources that generate strings with small entropy. The paper explores constructions of extractors that are practical and easy to implement. Randomized and deterministic constructions are presented and compared with some previously known constructions that achieve very good asymptotical performances. One of our methods is shown to have a better behavior for reasonable values of the involved parameters. 1 C.S.Calude and G.Stefanescu (eds.). Automata, Logic, and Computability. Special issue dedicated to Professor Sergiu Rudeanu Festschrift.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-006-01-0212
dc.identifierhttps://lib.jucs.org/article/27651/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/7712
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 6(1): 212-225
dc.subjectRandom bits
dc.subjectsource of randomness
dc.subjectextractors
dc.subjecthash functions
dc.titleExtractors for the Real World
dc.typeResearch Article
Файлы
Коллекции