Quantum Constacyclic BCH Codes over Qudits: A Spectral-Domain Approach

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Patel, Shikha, Garani, Shayan Srinivasa
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916334260977664
author Patel, Shikha
Garani, Shayan Srinivasa
author_facet Patel, Shikha
Garani, Shayan Srinivasa
contents We characterize constacyclic codes in the spectral domain using the finite field Fourier transform (FFFT) and propose a reduced complexity method for the spectral-domain decoder. Further, we also consider repeated-root constacyclic codes and characterize them in terms of symmetric and asymmetric $q$-cyclotomic cosets. Using zero sets of classical self-orthogonal and dual-containing codes, we derive quantum error correcting codes (QECCs) for both constacyclic Bose-Chaudhuri-Hocquenghem (BCH) codes and repeated-root constacyclic codes. We provide some examples of QECCs derived from repeated-root constacyclic codes and show that constacyclic BCH codes are more efficient than repeated-root constacyclic codes. Finally, quantum encoders and decoders are also proposed in the transform domain for Calderbank-Shor-Steane CSS-based quantum codes. Since constacyclic codes are a generalization of cyclic codes with better minimum distance than cyclic codes with the same code parameters, the proposed results are practically useful.
format Preprint
id arxiv_https___arxiv_org_abs_2407_16814
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Quantum Constacyclic BCH Codes over Qudits: A Spectral-Domain Approach
Patel, Shikha
Garani, Shayan Srinivasa
Quantum Physics
Information Theory
We characterize constacyclic codes in the spectral domain using the finite field Fourier transform (FFFT) and propose a reduced complexity method for the spectral-domain decoder. Further, we also consider repeated-root constacyclic codes and characterize them in terms of symmetric and asymmetric $q$-cyclotomic cosets. Using zero sets of classical self-orthogonal and dual-containing codes, we derive quantum error correcting codes (QECCs) for both constacyclic Bose-Chaudhuri-Hocquenghem (BCH) codes and repeated-root constacyclic codes. We provide some examples of QECCs derived from repeated-root constacyclic codes and show that constacyclic BCH codes are more efficient than repeated-root constacyclic codes. Finally, quantum encoders and decoders are also proposed in the transform domain for Calderbank-Shor-Steane CSS-based quantum codes. Since constacyclic codes are a generalization of cyclic codes with better minimum distance than cyclic codes with the same code parameters, the proposed results are practically useful.
title Quantum Constacyclic BCH Codes over Qudits: A Spectral-Domain Approach
topic Quantum Physics
Information Theory
url https://arxiv.org/abs/2407.16814