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.

2019

2019

We consider practical hardware implementation of polar decoders. To reduce latency due to the serial nature of successive… Expand

Is this relevant?

2016

2016

Two-parity maximum distance separable (MDS) array codes achieve the lowest storage overhead for tolerating two erasures. In this… Expand

Is this relevant?

2013

2013

Codes for distributed storage systems are often designed to sustain failure of multiple storage disks. Specifically, an (n, k… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

A super-polynomial lower bound is given for the size of circuits of fixed depth computing the parity function. Introducing the… Expand

Is this relevant?

2005

2005

Quasi-cyclic (QC) low-density parity-check (LDPC) codes form an important subclass of LDPC codes. These codes have encoding… Expand

Is this relevant?

2002

2002

Higgs decays to Z boson pairs may be exploited to determine spin and parity of the Higgs boson, a method complementary to spin… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise… Expand

Is this relevant?

Highly Cited

1999

Highly Cited

1999

Deals with problems related to the parity relation-based residual generation. A characterization of parity vectors and a… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

We present a membership-query algorithm for efficiently learning DNF with respect to the uniform distribution. In fact, the… Expand

Is this relevant?

1983

1983

We develop in this paper a simple way of generating a test set which simultaneously provides exhaustive pattern testing with… Expand

Is this relevant?