<p>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?</p>

<blockquote>
  <p>In other words what channel model does locally decodable code try to solve? Where does it fit in Shannon theory?</p>
</blockquote>

CC BY-SA 3.0
2013-08-28T03:45:04.877Z
I am not an expert, but afaik we don't have nearly as nice a picture. Klim Efremenko has some work on connections to representation theory http://www.cs.tau.ac.il/~klim/papers/Induced.pdf. Representation theory itself seeks to understand the structure of groups through geometry, by studying actions of the group on a vector space.
Sasho Nikolov
CC BY-SA 4.0
2019-05-28T17:43:36.710Z
@SashoNikolov representation theory also seeks to better understand vector spaces - and other objects - with additional symmetries by leveraging the symmetries. (understanding the groups themselves is just one application, albeit a particularly fruitful one :).)
Joshua Grochow
CC BY-SA 4.0
2019-05-30T13:09:20.093Z
Is there a clear relationship between the different questions in this post?
usul
CC BY-SA 4.0
2019-05-30T13:26:39.470Z
Shannon theory tells that there is atleast one geometrization mechanism which assigns a metric that comes with each channel by giving provide capacity results when we use the correct metric. Coding is incarnation that depends on the creativity of the instantiator of those purported geometrization mechanisms and without the full picture the instantiator always fall short of the promise of capacity results unless by good fortune.
Turbo
CC BY-SA 4.0
2019-05-30T19:26:25.397Z
I'm not sure that locally decodable codes are associated with a different channel model.
Peter Shor 
<big-picture><it.information-theory><coding-theory><shannon-entropy><shannon>
Geometric Intuition behind Locally testable codes
Turbo
# Geometric Intuition behind Locally testable codes

(Asked by: username_0 on 2013-08-27)

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?

**Tags:** big-picture, it.information-theory, coding-theory, shannon-entropy, shannon
> **Comments:**
> **username_1**: I am not an expert, but afaik we don't have nearly as nice a picture. Klim Efremenko has some work on connections to representation theory http://www.cs.tau.ac.il/~klim/papers/Induced.pdf. Representation theory itself seeks to understand the structure of groups through geometry, by studying actions of the group on a vector space.  
> **username_2**: @SashoNikolov representation theory also seeks to better understand vector spaces - and other objects - with additional symmetries by leveraging the symmetries. (understanding the groups themselves is just one application, albeit a particularly fruitful one :).)  
> **username_3**: Is there a clear relationship between the different questions in this post?  
> **username_0**: Shannon theory tells that there is atleast one geometrization mechanism which assigns a metric that comes with each channel by giving provide capacity results when we use the correct metric. Coding is incarnation that depends on the creativity of the instantiator of those purported geometrization mechanisms and without the full picture the instantiator always fall short of the promise of capacity results unless by good fortune.  
> **username_4**: I'm not sure that locally decodable codes are associated with a different channel model.  

---

## 0 answers

