Dihedral quantum codes
From MaRDI portal
Cites work
- Asymptotically good Quantum and locally testable classical LDPC codes
- Concise Encyclopedia of Coding Theory
- Dihedral codes with prescribed minimum distance
- Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
- Good quantum error-correcting codes exist
- scientific article; zbMATH DE number 49937 (Why is no real title available?)
- scientific article; zbMATH DE number 193091 (Why is no real title available?)
- scientific article; zbMATH DE number 612296 (Why is no real title available?)
- Moderate-density parity-check codes from projective bundles
- On quasi-cyclic codes as a generalization of cyclic codes
- Quantum LDPC Codes With Almost Linear Minimum Distance
- Quantum McEliece public-key cryptosystem
- Relationship between codes and idempotents in a dihedral group algebra
- Simple quantum error-correcting codes
- Structure of finite dihedral group algebra.
This page was built for publication: Dihedral quantum codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6876051)