Finite Blocklength Secrecy Codin

Coding for physical layer security is typically evaluated as blocklengths approach infinity using information theoretic measures. This thesis presents techniques to quantify secrecy guarantees of finite blocklength wiretap codes across two common channel models. This is an important step for the field of physical layer security as secrecy guarantees are generally not quantified at finite blocklengths. From this analysis, we are able to determine the best performing linear secrecy codes for their respective blocklengths and information rates. Due to the error correcting shortcomings of wiretap codes, we also investigate the error correcting capabilities of a secrecy coding technique that uses polar codes.