{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:36:40Z","timestamp":1729651000912,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1109\/icics.2011.6173599","type":"proceedings-article","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T17:57:10Z","timestamp":1333648630000},"page":"1-5","source":"Crossref","is-referenced-by-count":1,"title":["A forward-parsing randomness test based on the expected codeword length of T-codes"],"prefix":"10.1109","author":[{"given":"U.","family":"Speidel","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"13","first-page":"2010","article-title":"Ex-perimental evidence of quantum randomness incomputability","volume":"82","author":"calude","year":"0","journal-title":"Physical Review A"},{"key":"11","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1049\/ip-cds:20050168","article-title":"constructing finite pseudo-random strings using codeset-based entropy measures","volume":"153","author":"speidel","year":"2006","journal-title":"Circuits Devices and Systems IEE Proceedings-"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2008.4895570"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1049\/ip-e.1984.0028"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"10","first-page":"23","article-title":"A T-decomposition algorithm with O(n log n) time and space complexity","author":"yang","year":"2005","journal-title":"Proc IEEE Int Symp on Inform Theory Sept"},{"journal-title":"A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications","year":"2001","key":"7"},{"journal-title":"Robust Source Coding with Generalized TCodes","year":"1998","author":"guenther","key":"6"},{"key":"5","article-title":"Uniqueness theorems for T-codes","volume":"1","author":"nicolescu","year":"1998","journal-title":"Romanian J Inf Sci Technol"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:19960551"},{"key":"9","first-page":"91","article-title":"On the generation of aperiodic and periodic necklaces via T-augmentation","volume":"83","author":"gulliver","year":"2008","journal-title":"Fundamenta Informaticae"},{"key":"8","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1049\/ip-cds:20050168","article-title":"constructing finite pseudo-random strings using codeset-based entropy measures","volume":"153","author":"speidel","year":"2006","journal-title":"Circuits Devices and Systems IEE Proceedings-"}],"event":{"name":"2011 8th International Conference on Information, Communications & Signal Processing (ICICS 2011)","start":{"date-parts":[[2011,12,13]]},"location":"Singapore","end":{"date-parts":[[2011,12,16]]}},"container-title":["2011 8th International Conference on Information, Communications & Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6165552\/6173124\/06173599.pdf?arnumber=6173599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T00:08:15Z","timestamp":1561594095000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6173599\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icics.2011.6173599","relation":{},"subject":[],"published":{"date-parts":[[2011,12]]}}}