A Construction of New Quantum MDS Codes
Lingfei Jin, Chaoping Xing

TL;DR
This paper presents a novel construction method for quantum MDS codes with larger minimum distances than previously known, expanding the range of lengths and distances achievable using Hermitian self-orthogonal codes.
Contribution
It introduces a new approach to constructing quantum MDS codes with larger minimum distances via Hermitian self-orthogonal codes, extending known parameters.
Findings
Existence of $q$-ary quantum MDS codes with length $n=q^2+1$ and minimum distance up to $q+1$.
Construction of codes with length $(q^2+2)/3$ and minimum distance up to $(2q+2)/3$ under certain divisibility conditions.
Method based on solvability of systems of homogeneous equations over finite fields.
Abstract
It has been a great challenge to construct new quantum MDS codes. In particular, it is very hard to construct quantum MDS codes with relatively large minimum distance. So far, except for some sparse lengths, all known -ary quantum MDS codes have minimum distance less than or equal to . In the present paper, we provide a construction of quantum MDS codes with minimum distance bigger than . In particular, we show existence of -ary quantum MDS codes with length and minimum distance for any and (this result extends those given in \cite{Gu11,Jin1,KZ12}); and with length and minimum distance for any if . Our method is through Hermitian self-orthogonal codes. The main idea of constructing Hermitian self-orthogonal codes is based on the solvability in of a system of homogenous equations over…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Coding theory and cryptography · Quantum-Dot Cellular Automata
