Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Boolean functions for cryptography and coding theory
C Carlet - 2021 - books.google.com
Boolean functions are essential to systems for secure and reliable communication. This
comprehensive survey of Boolean functions for cryptography and coding covers the whole …
comprehensive survey of Boolean functions for cryptography and coding covers the whole …
Aurora: Transparent succinct arguments for R1CS
We design, implement, and evaluate a zero knowledge succinct non-interactive argument
(SNARG) for Rank-1 Constraint Satisfaction (R1CS), a widely-deployed NP language …
(SNARG) for Rank-1 Constraint Satisfaction (R1CS), a widely-deployed NP language …
Hybrid ARQ: Theory, state of the art and future directions
Hybrid ARQ transmission schemes combine the conventional ARQ with forward error
correction. Incremental redundancy hybrid ARQ schemes adapt their error correcting code …
correction. Incremental redundancy hybrid ARQ schemes adapt their error correcting code …
An inverse theorem for the Gowers U s+1 [N]-norm
We prove the inverse conjecture for the Gowers U s+ 1 N-norm for all s≥ 1; this is new for
s≥ 4. More precisely, we establish that if f: N→− 1, 1 is a function with …
s≥ 4. More precisely, we establish that if f: N→− 1, 1 is a function with …
A survey of quantum property testing
The area of property testing tries to design algorithms that can efficiently handle very large
amounts of data: given a large object that either has a certain property or is somehow" far" …
amounts of data: given a large object that either has a certain property or is somehow" far" …
A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels
In 1948, Shannon used a probabilistic argument to show that there exist codes achieving a
maximal rate defined by the channel capacity. In 1954, Muller and Reed introduced a simple …
maximal rate defined by the channel capacity. In 1954, Muller and Reed introduced a simple …
Algorithmic and analysis techniques in property testing
D Ron - Foundations and Trends® in Theoretical Computer …, 2010 - nowpublishers.com
Property testing algorithms are" ultra"-efficient algorithms that decide whether a given object
(eg, a graph) has a certain property (eg, bipartiteness), or is significantly different from any …
(eg, a graph) has a certain property (eg, bipartiteness), or is significantly different from any …
Ko codes: inventing nonlinear encoding and decoding for reliable wireless communication via deep-learning
Landmark codes underpin reliable physical layer communication, eg, Reed-Muller, BCH,
Convolution, Turbo, LDPC, and Polar codes: each is a linear code and represents a …
Convolution, Turbo, LDPC, and Polar codes: each is a linear code and represents a …
The distribution of polynomials over finite fields, with applications to the Gowers norms
In this paper we investigate the uniform distribution properties of polynomials in many
variables and bounded degree over a fixed finite field F of prime order. Our main result is …
variables and bounded degree over a fixed finite field F of prime order. Our main result is …
Property testing: A learning theory perspective
D Ron - Foundations and Trends® in Machine Learning, 2008 - nowpublishers.com
Property testing deals with tasks where the goal is to distinguish between the case that an
object (eg, function or graph) has a prespecified property (eg, the function is linear or the …
object (eg, function or graph) has a prespecified property (eg, the function is linear or the …