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:harm2009 [2010/06/06 14:45] cronie |
en:private:erclog:harm2009 [2016/06/23 11:26] (current) |
||
---|---|---|---|

Line 24: | Line 24: | ||

====== August ====== | ====== August ====== | ||

+ | * Theoretical foundation of linear form decoding is still missing. Working on this. | ||

+ | * Full paper for linear form decoding has to be written. Reimplementing simulations of Bertrand to have a second check. | ||

+ | * Looking into Reed-Solomon codes as an alternative for Raptor codes. | ||

* Polar codes for lossless source coding are very interesting. One can actually get a good finite length performance. Initial write-up {{:en:private:erclog:cronie_polar_ll_techreport.pdf|Polar codes lossless source coding}} | * Polar codes for lossless source coding are very interesting. One can actually get a good finite length performance. Initial write-up {{:en:private:erclog:cronie_polar_ll_techreport.pdf|Polar codes lossless source coding}} | ||

* Working on polar codes for rate-distortion coding of non-binary sources. Inital write up: {{:en:private:erclog:cronie_polar_rd.pdf|Polar codes rate-distortion}} | * Working on polar codes for rate-distortion coding of non-binary sources. Inital write up: {{:en:private:erclog:cronie_polar_rd.pdf|Polar codes rate-distortion}} | ||

Line 29: | Line 32: | ||

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

- | * | + | * Algorithm II for linear form decoding can be improved by continuing instead of resetting after a pass. |

* Some work summarized in slides for ALGO workshop: {{:en:private:erclog:workshop_30092009_cronie.pdf|Slides algo workshop 30-01-2009}} | * Some work summarized in slides for ALGO workshop: {{:en:private:erclog:workshop_30092009_cronie.pdf|Slides algo workshop 30-01-2009}} | ||

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

+ | * Continuing to write linear form full paper. Somewhat difficult since some theoretical foundation is missing. | ||

+ | * Fred's algorithm for decoding RS codes on the erasure channel is fast. However, field multiplication is still an issue. Looking into this. | ||

====== November ====== | ====== November ====== | ||

+ | * Looking into Fourier methods for decoding Reed-Solomon erasure codes. | ||

+ | * Extending Polar codes to non-binary setting. | ||

+ | * Found a nice algorithm for source coding with polar codes. Finite length performance can easily be computed. | ||

====== December ====== | ====== December ====== | ||

* Working on finalizing the linear form paper. Submitted to tcom: {{:en:private:erclog:cronie_lf_tcom.pdf|Linear form paper}} | * Working on finalizing the linear form paper. Submitted to tcom: {{:en:private:erclog:cronie_lf_tcom.pdf|Linear form paper}} | ||

* Working on the paper for ISIT about lossless source coding with polar codes: {{:en:private:erclog:cronie_polarll_isit.pdf|ISIT 2010 submission}} | * Working on the paper for ISIT about lossless source coding with polar codes: {{:en:private:erclog:cronie_polarll_isit.pdf|ISIT 2010 submission}} |