2023 (source code)
= 2023
{scope}
{title2=A16551W1}
{title2=B8.4}
Source paper: https://www.whatdotheyknow.com/request/ba_computer_science_past_papers/response/2577745/attach/2/202402%20183%20CS%20Papers.zip?cookie_passthrough=1
Solutions to all three questions.<Information theory examination paper A16551W1 (2023)>[Printed pp. 2–4, Questions 1–3]{ref} All <logarithms> are base two; <information entropy> is measured in <bits> and <code rates> in <bits> per <channel> use. Terms $0\log 0$ are zero. Question 3(b) contains an incorrect hint; its requested conclusion is proved directly below for deterministic <channel codes>. The repeat-until-success protocol in Question 3(c) requires $q<1$ to terminate.
Back to article page
