Some Applications of Coding Theory in Cryptography

I had worked on this presentation with a colleague of mine as part of the course EE605: Error Correcting Codes under Professor Nikhil Karamchandani. We looked into the use of minimal codewords in designing secret-sharing schemes with tailored access privileges. This was done by representing secrets and shares as digits of a q-ary linear code. We also looked into orthogonal arrays and how they connect to the construction of resilient functions. The final presentation can be viewed here