The theory of locally decodable codes is relatively young and actively developing. Locally decodable codes have applications in computational complexity theory and cryptography. They are also used in practice to ensure reliability in large distributed data storage systems. In the current course we introduce and motivate locally decodable codes, and discuss the central results of the subject. The course assumes basic familiarity with the properties of finite fields and is otherwise self-contained.