Presentation 2013-05-24
String Complexity based on Reduplication Parsing and its Application to Randomness Testing
Shigeru MAYA, Hirosuke YAMAMOTO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A randomness test based on LZ-compelxity was included in the NIST statistical test suite. However, it was removed because it has relatively large probability of type I error. In order to overcome this defect, a randomness test based on T-complexity was proposed. But, T-complexity has another defect such that the T-complexity of random sequences is considerably smaller than the maximum T-complexity. In order to overcome both defects of LZ-complexity and T-complexity, we propose a new complexity measure called RP-complexity, which is defined by reduplication parsing, and we show the validity of RP-complexity by a randomness test based on RP-complexity.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) randomness test / LZ-complexity / T-complexity
Paper # IT2013-8
Date of Issue

Conference Information
Committee IT
Conference Date 2013/5/17(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) String Complexity based on Reduplication Parsing and its Application to Randomness Testing
Sub Title (in English)
Keyword(1) randomness test
Keyword(2) LZ-complexity
Keyword(3) T-complexity
1st Author's Name Shigeru MAYA
1st Author's Affiliation Dep. of Mathematical Informatics, The University of Tokyo()
2nd Author's Name Hirosuke YAMAMOTO
2nd Author's Affiliation Dep. of Complexity Science & Engineering, The University of Tokyo
Date 2013-05-24
Paper # IT2013-8
Volume (vol) vol.113
Number (no) 58
Page pp.pp.-
#Pages 6
Date of Issue