Section 18.3.2.3: I(A; X) = -p(1-q)^nlg p+p[1-(1-q)^n]lg [1-(1-q)^n] -[1-p(1-q)^n]lg [1-p(1 − q)^n] We maximize this with respect to p to obtain the covert channel capacity. For notational conveniente, take m = (1 x q)^n and M = (1 x m)^(1-m). Then I(A; X) is a M maximum when p =M/(Mm+1). So the channel capacity is I(A; X) = [Mmlg p+ M(1- m)lg (1 - m) + lg (Mm+1)] / Mm+1 Section 18.3.2.3 derives a formula for I(A; X). Prove that this formula is a maximum with respect to p when p = (M^(1/m))/(1+mM^(1/m))

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Section 18.3.2.3: I(A; X) = -p(1-q)^nlg p+p[1-(1-q)^n]lg [1-(1-q)^n] -[1-p(1-q)^n]lg [1-p(1 − q)^n] We maximize this with respect to p to obtain the covert channel capacity. For notational conveniente, take m = (1 x q)^n and M = (1 x m)^(1-m). Then I(A; X) is a M maximum when p =M/(Mm+1). So the channel capacity is I(A; X) = [Mmlg p+ M(1- m)lg (1 - m) + lg (Mm+1)] / Mm+1 Section 18.3.2.3 derives a formula for I(A; X). Prove that this formula is a maximum with respect to p when p = (M^(1/m))/(1+mM^(1/m))

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Network Transmission Cabling
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education