Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2016

2014

2014

We introduce the notion of locally updatable and locally decodable codes (LULDCs). In addition to having low decode locality… Expand

Is this relevant?

2012

2012

Today’s lecture is on locally decodable codes. Current encoding schemes either involve storing all information in one block… Expand

Is this relevant?

2010

2010

We study the relation between locally testable and locally decodable codes. Locally testable codes (LTCs) are error-correcting… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

A <i>q</i>-query Locally Decodable Code (LDC) encodes an <i>n</i>-bit message <i>x</i> as an <i>N</i>-bit codeword <i>C</i>(<i>x… Expand

Is this relevant?

2007

2007

We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

For any odd integer q > 1, we improve the lower bound for general q-query locally decodable codes C : {0, 1}n → {0, 1}m from m… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

In this work we study two, seemingly unrelated, notions. Locally decodable codes (LDCs) are codes that allow the recovery of each… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

A locally decodable code encodes <i>n</i>-bit strings <i>x</i> in <i>m</i>-bit codewords <i>C(x)</i>, in such a way that one can… Expand

Is this relevant?