TH4.R8.1

Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal Rate

Geoffrey Mon, Dana Moshkovitz, Justin Oh, University of Texas at Austin, United States
Session:
Topics in Modern Coding Theory 3
Track:
2: Modern Coding Theory
Location:
Omega
Presentation Time:
Thu, 11 Jul, 16:25 - 16:45
Session Chair:
David Mitchell,
Presentation
Not logged in.
Discussion
Not logged in.
Session TH4.R8
TH4.R8.1: Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal Rate
Geoffrey Mon, Dana Moshkovitz, Justin Oh, University of Texas at Austin, United States
TH4.R8.2: Reverse PAC Codes: Look-ahead List Decoding
Xinyi Gu, Mohammad Rowshan, Jinhong Yuan, UNSW, Australia
TH4.R8.3: Game of Coding: Beyond Trusted Majorities
Hanzaleh Akbari Nodehi, University of Minnesota, United States; Viveck R. Cadambe, Pennsylvania State University, United States; Mohammad Ali Maddah-Ali, University of Minnesota, United States
TH4.R8.4: PoW Security-Latency and Transaction Rate
Mustafa Doger, Sennur Ulukus, University of Maryland, United States
Resources
No resources available.