Extractors from Reed-Muller codes (Q2496317)

From MaRDI portal

Revision as of 11:04, 25 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jcss/Ta-ShmaZS06, #quickstatements; #temporary_batch_1732528864361)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Extractors from Reed-Muller codes

scientific article

Language	Label	Description	Also known as
English	Extractors from Reed-Muller codes	scientific article

Statements

scholarly article

0 references

Extractors from Reed-Muller codes (English)

0 references

0 references

David Zuckerman

0 references

0 references

Journal of Computer and System Sciences

0 references

publication date

12 July 2006

0 references

zbMATH Keywords

extractors

0 references

Reed-Muller codes

0 references

expanders

0 references

pseudorandomness

0 references

derandomization

0 references

inapproximability

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.jcss.2005.05.010

0 references

On the complexity of approximating the VC dimension.

0 references

Expanders, randomness, or time versus space

0 references

On using deterministic functions to reduce randomness in probabilistic algorithms

0 references

Randomness is linear in space

0 references

Simulating BPP using a general weak random source

0 references

Computing with Very Weak Random Sources

0 references

0 references

0 references

Extractors and pseudorandom generators

0 references

Hardness vs randomness

0 references

Extractors and pseudo-random generators with optimal seed length

0 references

Extracting Randomness via Repeated Condensing

0 references

Loss-less condensers, unbalanced expanders, and extractors

0 references

Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators

0 references

Expanders that beat the eigenvalue bound: Explicit construction and applications

0 references

Perfect information leader election in \(\log^*n+O(1)\) rounds

0 references

Extractor Codes

0 references

Clique is hard to approximate within \(n^{1-\epsilon}\)

0 references

Better extractors for better codes?

0 references

Pseudo-random generators for all hardnesses

0 references

Pseudorandom generators without the XOR Lemma (extended abstract)

0 references

Decoding of Reed Solomon codes beyond the error-correction bound

0 references

Combinatorial bounds for list decoding

0 references

Small-Bias Probability Spaces: Efficient Constructions and Applications

0 references

Simple Constructions of Almost k-wise Independent Random Variables

0 references

Generating quasi-random sequences from semi-random sources

0 references

Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity

0 references

Extracting all the randomness and reducing the error in Trevisan's extractors

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.jcss.2005.05.010

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

DBLP publication ID

journals/jcss/Ta-ShmaZS06

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2496317

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2496317&oldid=37928582"