2000 character limit reached
Construction of wiretap codes from ordinary channel codes
Published 8 Jan 2010 in cs.IT, cs.CR, and math.IT | (1001.1197v1)
Abstract: From an arbitrary given channel code over a discrete or Gaussian memoryless channel, we construct a wiretap code with the strong security. Our construction can achieve the wiretap capacity under mild assumptions. The key tool is the new privacy amplification theorem bounding the eavesdropped information in terms of the Gallager function.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.