Computer Science – Information Theory
Scientific paper
2010-01-12
Computer Science
Information Theory
11 pages, 1 figure. An exposition of a result presented in an invited talk in ITW 2006, Chengdu, China
Scientific paper
An elementary proof of the attainability of random coding exponent with
linear codes for additive channels is presented. The result and proof are from
Hamada (Proc. ITW, Chendu, China, 2006), and the present material explains the
proof in detail for those unfamiliar with elementary calculations on
probabilities related to linear codes.
No associations
LandOfFree
An Exposition of a Result in "Conjugate Codes for Secure and Reliable Information Transmission" does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Exposition of a Result in "Conjugate Codes for Secure and Reliable Information Transmission", we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Exposition of a Result in "Conjugate Codes for Secure and Reliable Information Transmission" will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-458935