Presentation 2013-07-25
New Identification Codes based on Strongly Universal Classes of Hash Functions
Masashi UEDA, Hirosuke YAMAMOTO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper proposes a new construction method of identification (ID) codes based on strongly universal classes of hash functions (SUHF). The constructed ID codes can attain high coding rate if the encoder and the decoder share common randomness although Kurosawa-Yoshida's ID codes based on the SUHF cannot use the common randomness. Furthermore, our ID codes can attain high coding rate than Moulin and Koetter's ID codes based on Reed-Solomon codes, which can use common randomness.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Identification code / Strongly universal class of hash functions / Common randomness
Paper # IT2013-13
Date of Issue

Conference Information
Committee IT
Conference Date 2013/7/18(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) New Identification Codes based on Strongly Universal Classes of Hash Functions
Sub Title (in English)
Keyword(1) Identification code
Keyword(2) Strongly universal class of hash functions
Keyword(3) Common randomness
1st Author's Name Masashi UEDA
1st Author's Affiliation Graduate School of Information Science and Technology, The University of Tokyo()
2nd Author's Name Hirosuke YAMAMOTO
2nd Author's Affiliation Graduate School of Frontier Sciences, The University of Tokyo
Date 2013-07-25
Paper # IT2013-13
Volume (vol) vol.113
Number (no) 153
Page pp.pp.-
#Pages 6
Date of Issue