Conventional coding theory provides a good geometric picture behind linear error correction codes in terms of Hamming distance. What additional geometric requirement one should add to make a code locally decodable?
In other words what channel model does locally decodable code try to solve? Where does it fit in Shannon theory?