Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
From MaRDI portal
Publication:6107760
DOI10.1007/s11128-023-03958-7MaRDI QIDQ6107760
M. Paravee, Bac T. Nguyen, Thang M. Vo, Hai Quang Dinh, Hiep L. Thi
Publication date: 3 July 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Hamming distanceMDS codescyclic codesrepeated-root codesquantum synchronizable codesquantum MDS codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
- Repeated-root constacyclic codes of prime power lengths over finite chain rings
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\)
- Quantum MDS codes with large minimum distance
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Repeated-root constacyclic codes of length
- A combinatorial problem with applications to geometry
- New entanglement-assisted quantum codes from \(k\)-Galois dual codes
- A class of repeated-root constacyclic codes over \(\mathbb{F}_{p^m} [u / \langle u^e \rangle\) of type 2]
- Two new classes of quantum MDS codes
- Constructions of good entanglement-assisted quantum error correcting codes
- Entanglement-assisted quantum MDS codes constructed from negacyclic codes
- Negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) and their duals
- Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- An explicit representation and enumeration for negacyclic codes of length \(2^kn\) over \(\mathbb{Z}_4+u\mathbb{Z}_4\)
- Entanglement-assisted quantum codes from matrix-product codes
- Two new families of quantum synchronizable codes
- An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \)
- Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
- On matrix-product structure of repeated-root constacyclic codes over finite fields
- Construction of some new quantum MDS codes
- Quantum MDS codes with relatively large minimum distance from Hermitian self-orthogonal codes
- An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\)
- Entanglement-assisted quantum codes from cyclic codes and negacyclic codes
- Entanglement-assisted quantum MDS codes from cyclic codes
- A Construction of New MDS Symbol-Pair Codes
- Some New Classes of Quantum MDS Codes From Constacyclic Codes
- Application of Constacyclic Codes to Quantum MDS Codes
- Quantum Synchronizable Codes From Finite Geometries
- A Construction of New Quantum MDS Codes
- High-Rate Self-Synchronizing Codes
- Asynchronous Communication: Exact Synchronization, Universality, and Dispersion
- New Quantum MDS Codes From Negacyclic Codes
- Quantum Computation and Quantum Information
- Correcting Quantum Errors with Entanglement
- A note on upper bounds for minimum distance codes
- A Metrization for Power-Sets with Applications to Combinatorial Analysis
- A class of linear codes of length 2 over finite chain rings
- The Minimum Hamming Distance of Cyclic Codes of Length 2p s
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Semisimple cyclic and Abelian codes. II
- Error Correcting Codes in Quantum Theory
- Observation of Three-Photon Greenberger-Horne-Zeilinger Entanglement
- Theory of Quantum Error Correction for General Noise
- Enlargement of Calderbank-Shor-Steane quantum codes
- Nonbinary quantum stabilizer codes
- Non-Binary Quantum Synchronizable Codes From Repeated-Root Cyclic Codes
- Quantum error correction via codes over GF(4)
- Quantum weight enumerators
- Some New Constructions of Quantum MDS Codes
- Application of Classical Hermitian Self-Orthogonal MDS Codes to Quantum MDS Codes
- Mixed-state entanglement and quantum error correction
- On a class of constacyclic codes of length 4ps over 𝔽pm + u𝔽pm
- On (α + uβ)-constacyclic codes of length 4ps over 𝔽pm + u𝔽pm∗
- Polynomial weights and code constructions
- EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES
- Rook domains, Latin squares, affine planes, and error-distributing codes
- On repeated-root cyclic codes
- Repeated-root cyclic codes
- Orthogonal Arrays of Index Unity
This page was built for publication: Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)