A Combinatorial Interpretation for the Shor-Laflamme Weight Enumerators of CWS Codes

07/15/2021
by   Andrew Nemec, et al.
0

We show that one of the Shor-Laflamme weight enumerators of a codeword stabilized quantum code may be interpreted as the distance enumerator of an associated classical code.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/26/2021

Lee Weight for Nonbinary Quantum Error Correction

We propose the quantum Lee weight for quantum errors, provide a Gilbert-...
09/08/2020

Fiber Bundle Codes: Breaking the N^1/2polylog(N) Barrier for Quantum LDPC Codes

We present a quantum LDPC code family that has distance Ω(N^3/5/polylog(...
07/23/2021

The Diagonal Distance of CWS Codes

Quantum degeneracy in error correction is a feature unique to quantum er...
05/06/2021

Minimizing costs of communication with random constant weight codes

We present a framework for minimizing costs in constant weight codes whi...
06/23/2020

Discrete correlations of order 2 of generalised Rudin-Shapiro sequences: a combinatorial approach

We introduce a family of block-additive automatic sequences, that are ob...
07/06/2020

Weight Distribution of Classical Codes Influences Robust Quantum Metrology

Quantum metrology (QM) is expected to be a prominent use-case of quantum...
09/11/2018

A note on reducing the computation time for minimum distance and equivalence check of binary linear codes

In this paper we show the usability of the Gray code with constant weigh...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.