{"id":13760564,"url":"https://github.com/affeldt-aist/infotheo","last_synced_at":"2025-05-05T16:45:24.209Z","repository":{"id":27693889,"uuid":"114941836","full_name":"affeldt-aist/infotheo","owner":"affeldt-aist","description":"A Coq formalization of information theory and linear error-correcting codes","archived":false,"fork":false,"pushed_at":"2025-05-03T13:02:43.000Z","size":4390,"stargazers_count":70,"open_issues_count":14,"forks_count":16,"subscribers_count":5,"default_branch":"master","last_synced_at":"2025-05-03T14:19:33.238Z","etag":null,"topics":["convexity","error-correcting-codes","information-theory","math-comp","mathcomp","probability","ssreflect"],"latest_commit_sha":null,"homepage":"","language":"Coq","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"lgpl-2.1","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/affeldt-aist.png","metadata":{"files":{"readme":"README.md","changelog":"changelog.txt","contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2017-12-20T23:51:11.000Z","updated_at":"2025-05-03T13:02:40.000Z","dependencies_parsed_at":"2023-12-08T03:30:56.016Z","dependency_job_id":"43184044-b750-4717-a236-aa8abf471976","html_url":"https://github.com/affeldt-aist/infotheo","commit_stats":null,"previous_names":[],"tags_count":38,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/affeldt-aist%2Finfotheo","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/affeldt-aist%2Finfotheo/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/affeldt-aist%2Finfotheo/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/affeldt-aist%2Finfotheo/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/affeldt-aist","download_url":"https://codeload.github.com/affeldt-aist/infotheo/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252535569,"owners_count":21763975,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["convexity","error-correcting-codes","information-theory","math-comp","mathcomp","probability","ssreflect"],"created_at":"2024-08-03T13:01:13.039Z","updated_at":"2025-05-05T16:45:24.202Z","avatar_url":"https://github.com/affeldt-aist.png","language":"Coq","funding_links":[],"categories":["Projects","Rocq Prover","Coq"],"sub_categories":["Type Theory and Mathematics"],"readme":"\u003c!---\nThis file was generated from `meta.yml`, please do not edit manually.\nFollow the instructions on https://github.com/coq-community/templates to regenerate.\n---\u003e\n# A Coq formalization of information theory and linear error correcting codes\n\n[![Docker CI][docker-action-shield]][docker-action-link]\n\n[docker-action-shield]: https://github.com/affeldt-aist/infotheo/actions/workflows/docker-action.yml/badge.svg?branch=master\n[docker-action-link]: https://github.com/affeldt-aist/infotheo/actions?query=branch%3Amaster+event%3Apush\n\nInfotheo is a Coq library for reasoning about discrete probabilities,\ninformation theory, and linear error-correcting codes.\n\n## Meta\n\n- Author(s):\n  - Reynald Affeldt, AIST (initial)\n  - Manabu Hagiwara, Chiba U. (previously AIST) (initial)\n  - Jonas Senizergues, ENS Cachan (internship at AIST) (initial)\n  - Jacques Garrigue, Nagoya U.\n  - Kazuhiko Sakaguchi, Tsukuba U.\n  - Taku Asai, Nagoya U. (M2)\n  - Takafumi Saikawa, Nagoya U.\n  - Naruomi Obata, Titech (M2)\n  - Alessandro Bruni, IT-University of Copenhagen\n- License: [LGPL-2.1-or-later](LICENSE)\n- Compatible Coq versions: Coq 8.19--8.20\n- Additional dependencies:\n  - [MathComp ssreflect](https://math-comp.github.io)\n  - [MathComp fingroup](https://math-comp.github.io)\n  - [MathComp algebra](https://math-comp.github.io)\n  - [MathComp solvable](https://math-comp.github.io)\n  - [MathComp field](https://math-comp.github.io)\n  - [MathComp analysis](https://github.com/math-comp/analysis)\n  - [MathComp analysis reals standard library](https://github.com/math-comp/analysis)\n  - [Hierarchy Builder](https://github.com/math-comp/hierarchy-builder)\n  - [MathComp algebra tactics](https://github.com/math-comp/algebra-tactics)\n  - [CoqInterval](https://gitlab.inria.fr/coqinterval)\n- Coq namespace: `infotheo`\n- Related publication(s):\n  - [Robust Mean Estimation by All Means (short paper)]() \n  - [Trimming Data Sets: a Verified Algorithm for Robust Mean Estimation](https://dl.acm.org/doi/abs/10.1145/3479394.3479412) doi:[10.1145/3479394.3479412](https://doi.org/10.1145/3479394.3479412)\n  - [Formal Adventures in Convex and Conical Spaces](https://arxiv.org/abs/2004.12713) doi:[10.1007/978-3-030-53518-6_2](https://doi.org/10.1007/978-3-030-53518-6_2)\n  - [A Library for Formalization of Linear Error-Correcting Codes](https://link.springer.com/article/10.1007/s10817-019-09538-8) doi:[10.1007/s10817-019-09538-8](https://doi.org/10.1007/s10817-019-09538-8)\n  - [Reasoning with Conditional Probabilities and Joint Distributions in Coq](https://www.jstage.jst.go.jp/article/jssst/37/3/37_3_79/_article/-char/en) doi:[10.11309/jssst.37.3_79](https://doi.org/10.11309/jssst.37.3_79)\n  - [Examples of formal proofs about data compression](http://staff.aist.go.jp/reynald.affeldt/documents/compression-isita2018.pdf) doi:[10.23919/ISITA.2018.8664276](https://doi.org/10.23919/ISITA.2018.8664276)\n  - [Formalization of Reed-Solomon codes and progress report on formalization of LDPC codes](http://staff.aist.go.jp/reynald.affeldt/documents/rs_isita2016_author_version.pdf) \n  - [Formalization of error-correcting codes---from Hamming to modern coding theory](http://staff.aist.go.jp/reynald.affeldt/documents/eccITP2015_authorsversion.pdf) doi:[10.1007/978-3-319-22102-1_2](https://doi.org/10.1007/978-3-319-22102-1_2)\n  - [Formalization of Shannon’s Theorems](https://link.springer.com/article/10.1007%2Fs10817-013-9298-1) doi:[10.1007/s10817-013-9298-1](https://doi.org/10.1007/s10817-013-9298-1)\n\n## Building and installation instructions\n\nThe easiest way to install the latest released version of A Coq formalization of information theory and linear error correcting codes\nis via [OPAM](https://opam.ocaml.org/doc/Install.html):\n\n```shell\nopam repo add coq-released https://coq.inria.fr/opam/released\nopam install coq-infotheo\n```\n\nTo instead build and install manually, do (using GNU `make`):\n\n``` shell\ngit clone https://github.com/affeldt-aist/infotheo.git\ncd infotheo\nmake   # or make -j \u003cnumber-of-cores-on-your-machine\u003e \nmake -C extraction tests\nmake install\n```\n\n## Acknowledgments\n\nMany thanks to several [contributors](https://github.com/affeldt-aist/infotheo/graphs/contributors).\n\nThe principle of inclusion-exclusion is a contribution by \nErik Martin-Dorel (University Toulouse III Paul Sabatier, IRIT research laboratory)\n(main theorem: Pr_bigcup_incl_excl; commit 956096859ed89325b2bb74033690ac882bbcd64e)\n\nThe variable-length source coding theorems are a contribution by\nRyosuke Obi (Chiba U. (M2))\n(commit a67da5e24eaaabb345d225a5bd0f5e86d35413a8)\n(with Manabu Hagiwara and Mitsuharu Yamamoto)\n\nCommit 64814f529c1819684c4b8060d0779c24c6339041 was originally by Karl Palmskog\n\nThe formalization of modern coding theory is a collaboration with\nK. Kasai, S. Kuzuoka, R. Obi\n\nY. Takahashi collaborated to the formalization of linear error-correcting codes\n\nThis work was partially supported by a JSPS Grant-in-Aid for Scientific\nResearch (Project Number: 25289118), a JSPS Grand-in-Aid for Scientific Research (Project Number: 18H03204)\n\n## Documentation\n\nEach file is documented in its header.\n\nChanges are (lightly) documented in [changelog.txt](changelog.txt).\n\n## Installation with Windows 10 \u0026 11\n\nInstallation of infotheo on Windows is less simple.\nSee [this page](https://github.com/affeldt-aist/mathcomp-install/blob/master/install-windows-en.org)\nfor instructions to install MathComp on Windows 10 \u0026 11\n(or [this page](https://staff.aist.go.jp/reynald.affeldt/ssrcoq/install.html) for instructions in Japanese).\n\nOnce MathComp is installed (with opam), do\n`opam install coq-infotheo` or `git clone git@github.com:affeldt-aist/infotheo.git; opam install .`\n\n## Original License\n\nBefore version 0.2, infotheo was distributed under the terms of the\n`GPL-3.0-or-later` license.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faffeldt-aist%2Finfotheo","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faffeldt-aist%2Finfotheo","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faffeldt-aist%2Finfotheo/lists"}