Quantum cyclic redundancy check codes

05/24/2023
by   Ricard Vilar, et al.
0

We extend the idea of classical cyclic redundancy check codes to quantum cyclic redundancy check codes. This allows us to construct codes quantum stabiliser codes which can correct burst errors where the burst length attains the quantum Reiger bound. We then consider a certain family of quantum cyclic redundancy check codes for which we present a fast linear time decoding algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2018

Skew cyclic codes over F_p+uF_p+... +u^k-1F_p

In this article, we study the skew cyclic codes over R_k=F_p+uF_p+... +u...
research
06/15/2022

Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes

We introduce and analyse an efficient decoder for the quantum Tanner cod...
research
04/06/2021

Some comments about CRC selection for the 5G NR specification

In this work the undetected error probability performance of the propose...
research
05/23/2022

Cyclic Redundancy Checks and Error Detection

This study investigates the capabilities of Cyclic Redundancy Checks(CRC...
research
05/12/2022

Optimizing Apportionment of Redundancies in Hierarchical RAID

Large disk arrays are organized into storage nodes – SNs or bricks with ...
research
05/08/2022

Codes for Constrained Periodicity

Reliability is an inherent challenge for the emerging nonvolatile techno...
research
05/14/2021

Fortified quantum mass function utilizing ordinal pictorial check based on time interval analysis and expertise

Information management has enter a completely new era, quantum era. Howe...

Please sign up or login with your details

Forgot password? Click here to reset