Use the Brouwer-Zimmermann algorithm to compute code distance
Open
Nobody has claimed this yet.
high desirability
performance
- Dominant language
- Python
- Stars
- 255
- Forks
- 38
- Avg merge
- 11h 19m
- Merged PRs (30d)
- 9
Description
This should nominally work for classical codes, but it should be possible for quantum codes as well. See discussion.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with the linked Math Stack Exchange discussion and inspect the repository for existing code-distance entry points; the issue names no files or tests. Done means implementing the Brouwer-Zimmermann algorithm for classical codes and establishing whether and how it applies to quantum codes.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100