Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
From MaRDI portal
Publication:2099600
DOI10.1007/S11128-021-03306-7OpenAlexW3213939254MaRDI QIDQ2099600
Bac T. Nguyen, Roengchai Tansuchat, Ha T. Le, Hai Quang Dinh
Publication date: 24 November 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-021-03306-7
Hamming distanceMDS codescyclic codesrepeated-root codesquantum synchronizable codesquantum MDS codes
Quantum coding (general) (81P70) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)
Related Items (5)
New methods for constructing AEAQEC codes ⋮ New quantum codes and entanglement-assisted quantum codes from repeated-root cyclic codes of length \(2^rp^s\) ⋮ Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\) ⋮ QEC and EAQEC codes from cyclic codes over non-chain rings ⋮ Maximal entanglement EAQECCs from cyclic and constacyclic codes over \(\mathbb{F}_q+v_1\mathbb{F}_q+\cdots +v_{s-1}\mathbb{F}_q\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Asymmetric quantum Reed-Solomon and generalized Reed-Solomon codes
- 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
- Two new classes of quantum MDS codes
- Some quantum MDS codes with large minimum distance from generalized Reed-Solomon 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
- On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
- A note on the constructions of MDS self-dual codes
- 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
- Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
- Entanglement-assisted quantum codes from matrix-product codes
- Two new families of quantum synchronizable codes
- Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)
- A different construction for some classes of quantum MDS codes
- MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes
- Quantum MDS codes with relatively large minimum distance from Hermitian self-orthogonal codes
- New quantum MDS codes with large minimum distance and short length from generalized Reed-Solomon codes
- Asymmetric quantum codes: new codes from old
- Entanglement-assisted quantum codes from cyclic codes and negacyclic codes
- Entanglement-assisted quantum MDS codes from cyclic codes
- PURE ASYMMETRIC QUANTUM MDS CODES FROM CSS CONSTRUCTION: A COMPLETE CHARACTERIZATION
- A Construction of New MDS Symbol-Pair 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
- 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
- On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
- Quantum error correction via codes over GF(4)
- Quantum weight enumerators
- Additive Asymmetric Quantum Codes
- Application of Classical Hermitian Self-Orthogonal MDS Codes to Quantum MDS Codes
- CSS-Like Constructions of Asymmetric Quantum 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: Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
