qhb
Python codes for numerically searching for the Li-Xing bound N(d).
Science Score: 54.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
✓CITATION.cff file
Found CITATION.cff file -
✓codemeta.json file
Found codemeta.json file -
✓.zenodo.json file
Found .zenodo.json file -
○DOI references
-
✓Academic publication links
Links to: arxiv.org -
○Academic email domains
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (0.5%) to scientific vocabulary
Last synced: 6 months ago
·
JSON representation
·
Repository
Python codes for numerically searching for the Li-Xing bound N(d).
Basic Info
Statistics
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 1
- Releases: 0
Created over 3 years ago
· Last pushed over 3 years ago
Metadata Files
Readme
License
Citation
README.md
Quantum Hamming Bound
Nd.ipynb searches, for each d, for the minimum $n=N(d)$ for which $\arg \max\limits{t\in S} \frac{f(t;n)}{f_{t;n}} = 0$ where $S:= \{0,1,\dots , d-1 \}$.
ngeqNd.ipynb checks the validity of the condition $\arg \max\limits{t\in S} \frac{f(t;n)}{f{t;n}} = 0$ for $n>N(d)$ (up to n=500).
The preprint is available at https://arxiv.org/abs/2208.11800.
Owner
- Name: Faidon Andreadakis
- Login: Perfii
- Kind: user
- Location: Los Angeles, California
- Company: University of Southern California
- Repositories: 2
- Profile: https://github.com/Perfii
PhD student
Citation (Citation.cff)
cff-version: 1.2.0 authors: - family-names: "Andreadakis" given-names: "Faidon" - family-names: "Dallas" given-names: "Emmanuel" title: "QHB" version: 1.0.0 date-released: 2022-08-02 url: "https://github.com/Perfii/QHB"