Presentation 2010-03-05
Basics of Design and Analysis of Codes for Wiretap Channels
Mitsuru Hamada,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Recently, codes that are constructible in polynomial time and achieve any rate below the secrecy capacity for wiretap channels (Wyner, 1975) were obtained by the author (the constructions themselves were presented in the IEEE ITW 2006, Chengdu, China). This result (the achievability of the secrecy capacity) would better be understood if it was viewed as an application of some fundamental result obtained by the author, i.e., a bound on 'information leakage' for codes obtained with concatenation. The aim of this report is to describe this bound (reported in an earlier IEICE technical meeting, Dec. 2009) in detail. In fact, the bound is presented in a generalized form.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Wiretap channels / codes / constructible / secrecy capacity / achievable rates
Paper # IT2009-145,ISEC2009-153,WBS2009-124
Date of Issue

Conference Information
Committee ISEC
Conference Date 2010/2/25(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 Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Basics of Design and Analysis of Codes for Wiretap Channels
Sub Title (in English)
Keyword(1) Wiretap channels
Keyword(2) codes
Keyword(3) constructible
Keyword(4) secrecy capacity
Keyword(5) achievable rates
1st Author's Name Mitsuru Hamada
1st Author's Affiliation Quantum Information Science Research Center Tamagawa University Research Institute()
Date 2010-03-05
Paper # IT2009-145,ISEC2009-153,WBS2009-124
Volume (vol) vol.109
Number (no) 445
Page pp.pp.-
#Pages 8
Date of Issue