BCH codes with explicit minimum distance and applications in quantum synchronizable codes
From MaRDI portal
Cites work
- Dimensions of three types of BCH codes over \(\mathrm{GF}(q)\)
- Fundamentals of Error-Correcting Codes
- Idempotents and the BCH bound
- Non-Binary Quantum Synchronizable Codes From Repeated-Root Cyclic Codes
- Non-binary quantum synchronizable codes based on cyclic codes over \(\mathrm{F}_q\)
- Nonbinary quantum stabilizer codes
- On Quantum and Classical BCH Codes
- Parameters of Several Classes of BCH Codes
- Quantum error correction via codes over GF(4)
- Quantum error correction. Symmetric, asymmetric, synchronizable, and convolutional codes
- Quantum synchronizable codes from the Whiteman's generalized cyclotomy
- Some quantum synchronizable codes with explicit distance
- Some results on the minimum weight of primitive BCH codes (Corresp.)
- Studying the locator polynomials of minimum weight codewords of BCH codes
- The q-Ary Antiprimitive BCH Codes
- The Bose and Minimum Distance of a Class of BCH Codes
- The dimension and minimum distance of two classes of primitive BCH codes
- The dual-containing primitive BCH codes with the maximum designed distance and their applications to quantum codes
- The maximum designed distances of dual-containing non-primitive BCH codes
- Two new families of quantum synchronizable codes
This page was built for publication: BCH codes with explicit minimum distance and applications in quantum synchronizable codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6915708)