{
  "$schema": "https://siliconverify.com/schemas/tool-v1.json",
  "slug": "comm-info",
  "title": "Information Theory &amp; Source Coding — Entropy, Huffman, BSC / BEC / Shannon-Hartley — Communication",
  "category": "communication",
  "category_label": "Communication",
  "urls": {
    "interactive": "https://siliconverify.com/comm-info.html",
    "static_sheet": "https://siliconverify.com/ref-comm-info.html",
    "api_doc": "https://siliconverify.com/api/comm-info.json",
    "blog_index": "https://siliconverify.com/llms-communication.txt"
  },
  "description": "The Information Theory workbench covers the source-coding and channel-capacity theorems. Source side: H(X) entropy, Huffman codes, Shannon-Fano codes, comparison of L̄ vs H(X). Channel side: BSC, BEC, Z-channel, generic DMC capacities, Blahut-Arimoto for arbitrary channels, Shannon-Hartley for AWGN. Use it to compute \"how compressible is this source?\" and \"how fast can I send through this channel?\"",
  "keywords": [
    "information theory",
    "entropy",
    "Huffman",
    "Shannon-Fano",
    "source coding",
    "channel capacity",
    "BSC",
    "BEC",
    "DMC",
    "Shannon-Hartley",
    "spectral efficiency",
    "Kraft inequality",
    "mutual information",
    "GATE ECE",
    "communication"
  ],
  "pricing": {
    "class": "workbench-tool",
    "protocol": "x402",
    "network": "base",
    "currency": "USDC",
    "price_atomic": 1000,
    "price_usd": 0.001,
    "payTo": "0x97DAA5649Fd7Dfe3e46fCd9f75516e36E750eed7",
    "static_sheet_price_atomic": 1000,
    "export_price_atomic": 5000
  },
  "content": {
    "formulas": [
      "Entropy: H(X) = −Σ p_i·log₂(p_i) bits/symbol",
      "Binary entropy: h(p) = −p·log₂(p) − (1−p)·log₂(1−p)",
      "Source coding theorem: H(X) ≤ L̄ < H(X) + 1 (Huffman is optimal)",
      "Kraft inequality: Σ 2^{−l_i} ≤ 1 (prefix code exists)",
      "BSC capacity: C = 1 − h(p)",
      "BEC capacity: C = 1 − ε",
      "Shannon-Hartley: C = B·log₂(1 + S/N) (AWGN)"
    ],
    "citations": [
      "Cover, T. M., Thomas, J. A., \"Elements of Information Theory,\" 2nd ed., Wiley, 2006.",
      "Shannon, C. E., \"A Mathematical Theory of Communication,\" Bell System Tech. J., 1948."
    ],
    "faq": [
      {
        "q": "Why does a binary symmetric channel with p = 0.5 have C = 0?",
        "a": "The output is independent of the input. I(X; Y) = 0. The channel carries no information. The student must understand \"binary symmetric\" means both error directions are equally likely."
      },
      {
        "q": "Huffman is optimal for symbol-by-symbol coding — what about blocks?",
        "a": "For block coding, arithmetic coding is optimal: L̄ approaches H(X) as block length → ∞. Huffman L̄ approaches H(X) + 1/N for block length N."
      }
    ]
  },
  "accessibility": {
    "crawlable": true,
    "javascript_required": true,
    "static_alternative": "/ref-comm-info.html",
    "structured_data": [
      "TechArticle",
      "SoftwareApplication",
      "FAQPage",
      "BreadcrumbList"
    ]
  },
  "x402_challenge_example": {
    "request": "curl -A 'GPTBot/1.0' -i https://siliconverify.com/comm-info.html",
    "response_headers": [
      "HTTP/1.1 402 Payment Required",
      "X-Siliconverify-Resource-Class: workbench-tool",
      "X-Siliconverify-Price-Atomic: 1000",
      "X-Siliconverify-Price-USD: 0.001"
    ],
    "response_body": "{\n  \"x402Version\": 1,\n  \"accepts\": [\n    {\n      \"scheme\": \"exact\",\n      \"network\": \"base\",\n      \"maxAmountRequired\": \"1000\",\n      \"resource\": \"https://siliconverify.com/comm-info.html\",\n      \"description\": \"SiliconVerify workbench tool — interactive browser-based engineering calculator. Client-side computation, no server cost.\",\n      \"mimeType\": \"text/html\",\n      \"payTo\": \"0x97DAA5649Fd7Dfe3e46fCd9f75516e36E750eed7\",\n      \"validAfter\": 1783274656,\n      \"validBefore\": 1783274956\n    }\n  ]\n}",
    "paid_request": "curl -A 'GPTBot/1.0' -H 'X-PAYMENT: 0x<txhash>' -i https://siliconverify.com/comm-info.html"
  },
  "last_updated": "2026-07-05"
}