Presentation 2009-12-16
Constructive Codes Achieving the Secrecy Capacity of Wiretap Channels
Mitsuru Hamada,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A theorem which states that constructive codes achieve any rate below the secrecy capacity for discrete memoryless wiretap channels (Wyner, 1975) is presented. The codes (or their encoders) are constructible in polynomial time.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Wiretap channels / codes / constructible / secrecy capacity / achievable rates
Paper # ISEC2009-73
Date of Issue

Conference Information
Committee ISEC
Conference Date 2009/12/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Vice Chair

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) Constructive Codes Achieving the Secrecy Capacity of 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 2009-12-16
Paper # ISEC2009-73
Volume (vol) vol.109
Number (no) 337
Page pp.pp.-
#Pages 8
Date of Issue