MDS, Hermitian Almost MDS, and Gilbert-Varshamov Quantum Codes from Generalized Monomial-Cartesian Codes

07/28/2023
by   Beatriz Barbero-Lucas, et al.
0

We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes. Our construction uses an explicitly defined twist vector, and we present formulas for the minimum distance and dimension. Generalized monomial-Cartesian codes arise from polynomials in m variables. When m=1 our codes are MDS, and when m=2 and our lower bound for the minimum distance is 3 the codes are at least Hermitian Almost MDS. For an infinite family of parameters when m=2 we prove that our codes beat the Gilbert-Varshamov bound. We also present many examples of our codes that are better than any known code in the literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2020

Two new classes of quantum MDS codes from generalized Reed-Solomon codes

In this paper, we mainly use classical Hermitian self-orthogonal general...
research
03/20/2018

New Quantum MDS codes constructed from Constacyclic codes

Quantum maximum-distance-separable (MDS) codes are an important class of...
research
02/15/2020

On the dimension of ideals in group algebras, and group codes

Several relations and bounds for the dimension of principal ideals in gr...
research
02/04/2021

Minimizing the alphabet size in codes with restricted error sets

This paper focuses on error-correcting codes that can handle a predefine...
research
05/09/2023

On the Structure of Higher Order MDS Codes

A code of length n is said to be (combinatorially) (ρ,L)-list decodable ...
research
08/12/2022

Stabilizer quantum codes defined by trace-depending polynomials

Quantum error-correcting codes with good parameters can be constructed b...
research
11/02/2022

MDS Variable Generation and Secure Summation with User Selection

A collection of K random variables are called (K,n)-MDS if any n of the ...

Please sign up or login with your details

Forgot password? Click here to reset