Aug 10, 2015 · We develop a new technique for proving lower bound on the Fourier sparsity of GF(2) polynomials, and apply it to certain special classes of ...

We develop a new technique for proving lower bound on the Fourier sparsity of GF(2) polynomials, and apply it to certain special classes of polynomials.

We develop a new technique for proving lower bound on the Fourier sparsity of GF(2) polynomials, and apply it to certain special classes of polynomials to ...

A new technique for proving lower bound on the Fourier sparsity of GF2 polynomials is developed, and applied to certain special classes of polynmials to ...

We develop a new technique for proving lower bound on the Fourier sparsity of GF2 polynomials, and apply it to certain special classes of polynomials to ...

We develop a new technique for proving lower bound on the Fourier sparsity of GF(2) polynomials, and apply it to certain special classes of polynomials to ...

Tsang, Hing Yin, Xie, Ning, Zhang, Shengyu. (2016). Fourier Sparsity of GF(2) Polynomials . EURO-PAR 2011 PARALLEL PROCESSING, PT 1, 9691 409-424.

We develop a new technique for proving lower bound on the Fourier sparsity of GF(2) polynomials, and apply it to certain special classes of polynomials to ...

The agenda for today's lecture is. • Analysis of Linearity testing using Fourier technique. • Introduction to Coding theory and polynomial codes.

Bibliographic details on Fourier Sparsity of GF(2) Polynomials.