EPFL

Algo+LMA

This shows you the differences between two versions of the page.

Both sides previous revision Previous revision Next revision | Previous revision | ||

en:private:erclog:ghid2011 [2012/04/18 16:56] maatouk |
en:private:erclog:ghid2011 [2016/06/23 11:26] (current) |
||
---|---|---|---|

Line 24: | Line 24: | ||

* Attended the Conference on Computational Complexity (CCC), San Jose, USA. Presented joint publication with Ben-Sasson, Shpilka and Sudan. {{:en:private:erclog:ccc_not_testable4.pdf|Slides}}. | * Attended the Conference on Computational Complexity (CCC), San Jose, USA. Presented joint publication with Ben-Sasson, Shpilka and Sudan. {{:en:private:erclog:ccc_not_testable4.pdf|Slides}}. | ||

* Still working on parallelizing syndrome computations for the RS speedup. | * Still working on parallelizing syndrome computations for the RS speedup. | ||

+ | * Working with Christina Fragouli, Vinod Prabhakaran and Yasin Büyükalp (a student we're supervising) on a project that extends some work I did under supervision of Christina and Vinod in the Network Coding class I took last Fall. We define a new security criterion for network coding, namely, intermediate nodes not learning "more than they should", and use one-time pads to ensure security. Previously I gave an algorithm that ensures security over a special kind of combination network and we think it is optimal. We study lower bounds on the minimum info that must be transmitted among sources to ensure security, and try to formulate some algorithms. | ||

===== July ===== | ===== July ===== | ||

Line 29: | Line 30: | ||

* Participated in the workshop "Aspects of Coding Theory", EPFL. | * Participated in the workshop "Aspects of Coding Theory", EPFL. | ||

* Working on parallelizing syndrome computations, but it looks like this is going nowhere. | * Working on parallelizing syndrome computations, but it looks like this is going nowhere. | ||

+ | * Still working on the network coding project with Christina, Vinod and Yasin. | ||

* Starting to look at spatially-coupled codes. | * Starting to look at spatially-coupled codes. | ||

Line 36: | Line 38: | ||

* Visited Madhu Sudan at Microsoft Research. | * Visited Madhu Sudan at Microsoft Research. | ||

* Working with Sudan on Conjecture 5.9 in our paper [BGMSS] (see March above). It turns out the sets of degrees indexing the rows in our case relate to so-called "interpolating exponent sets" studied by Shokrollahi. Trying to see if we can find tools in this direction to prove our conjecture, which in turn would basically imply that locally testable families that are not low-degree polynomials must be sparse. | * Working with Sudan on Conjecture 5.9 in our paper [BGMSS] (see March above). It turns out the sets of degrees indexing the rows in our case relate to so-called "interpolating exponent sets" studied by Shokrollahi. Trying to see if we can find tools in this direction to prove our conjecture, which in turn would basically imply that locally testable families that are not low-degree polynomials must be sparse. | ||

+ | * Still working on the secure network coding project. | ||

===== September ===== | ===== September ===== | ||

Line 41: | Line 44: | ||

* Participated in the workshop "Algebraic Coding Theory", September 7-9, EPFL. Gave a talk about our results in [BMSS] publication. | * Participated in the workshop "Algebraic Coding Theory", September 7-9, EPFL. Gave a talk about our results in [BMSS] publication. | ||

* Reading up on spatially coupled codes; organizing an informal internal seminar to discuss them. One question is finding a simple explanation to why they perform so well and thinking of the finite length case. | * Reading up on spatially coupled codes; organizing an informal internal seminar to discuss them. One question is finding a simple explanation to why they perform so well and thinking of the finite length case. | ||

+ | * Still working on the secure network coding project. | ||

===== October ===== | ===== October ===== |