c<sup>3</sup>-Locally Testable Codes from Lossless Expanders
- Publisher:
- Institute of Electrical and Electronics Engineers (IEEE)
- Publication Type:
- Conference Proceeding
- Citation:
- IEEE International Symposium on Information Theory - Proceedings, 2022, 2022-June, pp. 1175-1180
- Issue Date:
- 2022-01-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| c3-Locally_Testable_Codes_from_Lossless_Expanders.pdf | Published version | 980.45 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
A locally testable code (LTC) is an error correcting code with a property tester. The tester tests if a word is a codeword by reading constant random bits and rejects the word with probability proportional to the distance from the word to the closest codeword. An important open question until recently is whether there exist c3-LTCs which are LTCs with a constant rate, constant relative distance, and constant locality. In this work, we construct a new LTC family using 1-sided lossless expanders and balanced products.
Please use this identifier to cite or link to this item: