Amanote Research
Register
Sign In
The Channel Coding Theorem and the Security of Binary Randomization
doi 10.1109/isit.2003.1228321
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2003
Authors
P.L. Vora
Publisher
IEEE
Related search
Randomization, Blinding, and Coding
Joint Source-Channel Turbo Coding for Binary Markov Sources
IEEE Transactions on Wireless Communications
Electronic Engineering
Applied Mathematics
Computer Science Applications
Electrical
Binary Symmetric Channel Based Aggregation With Coding for 802.11n WLANs
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Computer Networks
Communications
A Theorem on the Semigroup of Binary Relations
Proceedings of the American Mathematical Society
Mathematics
Applied Mathematics
A Geometrical Theorem and the Resultant of Two Binary Forms
Proceedings of the Edinburgh Mathematical Society
Mathematics
Fast Randomization for Distributed Low-Bitrate Coding of Speech and Audio
IEEE/ACM Transactions on Audio Speech and Language Processing
Electronic Engineering
Ultrasonics
Signal Processing
Instrumentation
Acoustics
Media Technology
Hearing
Electrical
Computer Science
Speech
Computational Mathematics
A Theorem About the Channel Assignment Problem
SIAM Journal on Discrete Mathematics
Mathematics
Channel Coding in the Presence of Side Information
Foundations and Trends in Communications and Information Theory
Computer Networks
Applied Mathematics
Communications
Coding for the Fading Channel: A Survey
Signal Processing
Control
Systems Engineering
Pattern Recognition
Electronic Engineering
Computer Vision
Electrical
Signal Processing
Software
