✦ LIBER ✦

Locally testable cyclic codes

✍ Scribed by Babai, L.; Shpilka, A.; Stefankovic, D.

Book ID: 114638848
Publisher: IEEE
Year: 2005
Tongue: English
Weight: 360 KB
Volume: 51
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2005.851735

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combinatorial Construction of Locally Te

Combinatorial Construction of Locally Testable Codes

✍ Meir, Or 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 597 KB

Locally Testable Codes Require Redundant

Locally Testable Codes Require Redundant Testers

✍ Ben-Sasson, Eli; Guruswami, Venkatesan; Kaufman, Tali; Sudan, Madhu; Viderman, M 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 277 KB

Towards lower bounds on locally testable

Towards lower bounds on locally testable codes via density arguments

✍ Ben-Sasson, Eli; Viderman, Michael 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 498 KB

Locally testable semigroups

✍ Yechezkel Zalcstein 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 535 KB

Locally testable languages

✍ Yechezkel Zalcstein 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 877 KB

This paper studies the locally testable languages (or "events") introduced by McNaughton and Papert. We characterize these languages by means of their syntactic semigroups and obtain wreath product and direct product decompositions for these semigroups. As a by-product of our study, we find an algeb

Bilateral locally testable languages

✍ Pedro Garcı&#x0301;a; José Ruiz; Manuel Vazquez de Parga 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 218 KB

We give an algebraic characterization of a new variety of languages that will be called bilateral locally testable languages and denoted as BLT. Given k ¿ 0, the membership of a word x to a BLT (k-BT) language can be decided by means of exploring the segments of length k of x, as well as considering