Loading...
Please wait, while we are loading the content...
Similar Documents
Efficiently Decodable Low-Rate Codes Meeting
| Content Provider | Semantic Scholar |
|---|---|
| Author | Gilbert |
| Copyright Year | 2004 |
| Abstract | We demonstrate a probabilistic construction of binary linear codes meeting the GilbertVarshamov bound (with overwhelming probability) for rates up to about 10−4, together with polynomial time algorithms to perform encoding and decoding up to half the distance. This is the first such result (for some positive rate) with polynomial decoding complexity; previously a similar result (up to rate about 0.02) was known with sub-exponential time decoding (Zyablov and Pinsker, 1981). |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://theory.csail.mit.edu/~indyk/gv-allerton.pdf |
| Alternate Webpage(s) | http://people.csail.mit.edu/indyk/gv-allerton.pdf |
| Alternate Webpage(s) | https://people.csail.mit.edu/indyk/gv-allerton.pdf |
| Alternate Webpage(s) | http://theory.lcs.mit.edu/~indyk/gv-allerton.pdf |
| Alternate Webpage(s) | http://www.cs.cmu.edu/~venkatg/pubs/papers/lowrate-gv.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
