{"id":17040619,"url":"https://github.com/weileizeng/css-code-database","last_synced_at":"2025-07-29T15:34:53.883Z","repository":{"id":65895559,"uuid":"601431339","full_name":"WeileiZeng/CSS-Code-Database","owner":"WeileiZeng","description":"DataBase for CSS codes with n=1..30","archived":false,"fork":false,"pushed_at":"2023-09-27T03:33:59.000Z","size":10849,"stargazers_count":3,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-29T17:44:55.378Z","etag":null,"topics":["css-code","database","distance","quantum-error-correction"],"latest_commit_sha":null,"homepage":"https://github.com/WeileiZeng/CSS-Code-Database","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/WeileiZeng.png","metadata":{"files":{"readme":"README.md","changelog":null,"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}},"created_at":"2023-02-14T03:30:38.000Z","updated_at":"2024-04-29T06:29:12.000Z","dependencies_parsed_at":"2023-09-27T09:26:48.848Z","dependency_job_id":null,"html_url":"https://github.com/WeileiZeng/CSS-Code-Database","commit_stats":null,"previous_names":[],"tags_count":4,"template":false,"template_full_name":null,"purl":"pkg:github/WeileiZeng/CSS-Code-Database","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/WeileiZeng%2FCSS-Code-Database","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/WeileiZeng%2FCSS-Code-Database/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/WeileiZeng%2FCSS-Code-Database/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/WeileiZeng%2FCSS-Code-Database/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/WeileiZeng","download_url":"https://codeload.github.com/WeileiZeng/CSS-Code-Database/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/WeileiZeng%2FCSS-Code-Database/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267709562,"owners_count":24131912,"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","status":"online","status_checked_at":"2025-07-29T02:00:12.549Z","response_time":2574,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["css-code","database","distance","quantum-error-correction"],"created_at":"2024-10-14T09:10:04.120Z","updated_at":"2025-07-29T15:34:48.867Z","avatar_url":"https://github.com/WeileiZeng.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# CSS-Code-Database\nAuthor: Weilei Zeng\n\nThis is a database of CSS codes, with `n=4..30` and distances up to 5/6. All parameters were saved, including k, x, and z stabilizers, in JSON format. Stabilizer matrices were saved in Matrix Market Format.\n\n## Purpose\nWhen doing research related to CSS codes, small sample codes are needed to get quick results or to construct product codes. A database for codes with various parameters will ease this process a lot.\n\n## Data download:\nThe folder `codes` has enough codes to generate the table. For more codes with duplicated parameters and other versions, please download from the [GitHub release page](https://github.com/WeileiZeng/CSS-Code-Database/releases) or [Google Drive](https://drive.google.com/drive/folders/1Ju3D4Yif_sBxDkR-sW2LkfWtnPXHSpSU?usp=sharing)\n\nFile list\n|Filename| Size| Codes count|Content|\n|-|-|-|-|\n|sample.tar| 45M|34,582| only i1 |\n|css-codes-v1.0.tar|382M| 400,000+ |i0 - i9 |\n\nFolder structure:\n\n![](tree.png)\n\n\nSample file name (replace `n6k4d1-x1z1dx1dz1-1` for `\u003ccode\u003e`):\n- `codes/i1/n6/k4/n6k4d1-x1z1dx1dz1-1Gx.mm`\n- `codes/i1/n6/k4/n6k4d1-x1z1dx1dz1-1Gz.mm`\n- `codes/i1/n6/k4/n6k4d1-x1z1dx1dz1-1.json`\n\nFormat: replace \u003c\u003e for allowed parameters\n- `codes/i\u003c\u003e/n\u003c\u003e/k\u003c\u003e/n\u003c\u003ek\u003c\u003ed\u003c\u003e-x\u003c\u003ez\u003c\u003edx\u003c\u003edz\u003c\u003e-\u003c\u003e.json`\n- `codes/i\u003c\u003e/n\u003c\u003e/k\u003c\u003e/n\u003c\u003ek\u003c\u003ed\u003c\u003e-x\u003c\u003ez\u003c\u003edx\u003c\u003edz\u003c\u003e-\u003c\u003eGx.mm`\n- `codes/i\u003c\u003e/n\u003c\u003e/k\u003c\u003e/n\u003c\u003ek\u003c\u003ed\u003c\u003e-x\u003c\u003ez\u003c\u003edx\u003c\u003edz\u003c\u003e-\u003c\u003eGz.mm`\n\n## How to use\nThe data comply with Matrix Market and JSON format and can be extracted by any IO tools. Here we provide sample code in Python. Check out the notebook [dataIO.ipynb]()\n\n## [[n,k,d]] table\nversion 1.4.1, (run3 as of Sept 27, 2023)\n\n_Disclaimer_: This table displays collected statistics from heavy random sampling. Theoretically, it is only the lower distance bound for each (k,d) set, though it matches the maximum distance for most entries.\n\nRow index for n, column index for k, and element for d\n\n```\n[n,k,d] table\nn=0:    [   1  2  3  4  5  6  7  8  9     1  2  3  4  5  6  7  8  9     1  2  3  4  5  6  7]\nn=1:    [                                                                                  ]\nn=2:    [                                                                                  ]\nn=3:    [                                                                                  ]\nn=4:    [   2  2                                                                           ]\nn=5:    [   2  2  1                                                                        ]\nn=6:    [   2  2  2  2                                                                     ]\nn=7:    [   3  2  2  2  1                                                                  ]\nn=8:    [   3  2  2  2  2  2                                                               ]\nn=9:    [   3  2  2  2  2  2  1                                                            ]\nn=10:   [   3  2  2  2  2  2  2  1                                                         ]\nn=11:   [   3  3  2  2  2  2  2  2  1                                                      ]\nn=12:   [   3  3  3  2  2  2  2  2  2  1                                                   ]\nn=13:   [   3  3  3  2  2  2  2  2  2  2  1                                                ]\nn=14:   [   3  3  3  3  3  2  2  2  2  2  2  1                                             ]\nn=15:   [   4  3  3  3  3  2  2  2  2  2  2  2  1                                          ]\nn=16:   [   4  3  3  3  3  2  2  2  2  2  2  2  2  1                                       ]\nn=17:   [   4  4  3  3  3  3  3  2  2  2  2  2  2  2  1                                    ]\nn=18:   [   4  4  3  3  3  3  3  2  2  2  2  2  2  2  1  1                                 ]\nn=19:   [   4  4  4  3  3  3  3  3  2  2  2  2  2  2  2  1  1                              ]\nn=20:   [   4  4  4  3  3  3  3  3  2  2  2  2  2  2  2  2  1  1                           ]\nn=21:   [   4  4  4  4  4  3  3  3  3  2  2  2  2  2  2  2  2  1  1                        ]\nn=22:   [   5  4  4  4  4  3  3  3  3  3  2  2  2  2  2  2  2  2  1  1                     ]\nn=23:   [   5  4  4  4  4  3  3  3  3  3  3  2  2  2  2  2  2  2  2  1  1                  ]\nn=24:   [   5  4  4  4  4  4  3  3  3  3  3  2  2  2  2  2  2  2  2  2  1  1               ]\nn=25:   [   5  4  4  4  4  4  4  3  3  3  3  3  2  2  2  2  2  2  2  2  2  1  1            ]\nn=26:   [   5  5  4  4  4  4  4  3  3  3  3  3  3  2  2  2  2  2  2  2  2  2  1  1         ]\nn=27:   [   5  5  4  4  4  4  4  4  3  3  3  3  3  3  2  2  2  2  2  2  2  2  2  1  1      ]\nn=28:   [   5  5  5  4  4  4  4  4  3  3  3  3  3  3  2  2  2  2  2  2  2  2  2  2  1  1   ]\nn=29:   [   5  5  5  5  4  4  4  4  4  3  3  3  3  3  3  2  2  2  2  2  2  2  2  2  2  1  1]\nn=30:   [   5  5  5  5  4  4  4  4  4  4  3  3  3  3  3  3  2  2  2  2  2  2  2  2  2  1  1]\ntotal number of codes: 17825\n```\n\nAlgorithm\n```\nfor n=4..30\n    for rx=1..\u003cn-2\u003e\n\tfor rz=1..\u003cn-rx-2\u003e\n\t    generate random matrix Hx\n\t    solve for dual matrix G such that Hx*G^T=0\n\t    get Hz by concatenating G into rz rows \n\t    estimate parameters n,k,d,dx,dz，\n\t    if unique\n\t        save CSS code defined by parity check matrices Hx and Hz, \n\t    end if\n\tend for\n    end for\nend for\t    \n```\n\n## LICENSE\nThis database complies with the MIT License. It is open to use and build upon it.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fweileizeng%2Fcss-code-database","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fweileizeng%2Fcss-code-database","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fweileizeng%2Fcss-code-database/lists"}