Improved constructions of nested code pairs
arXiv:1610.06363 · doi:10.1109/TIT.2017.2755682
Abstract
Two new constructions of linear code pairs are given for which the codimension and the relative minimum distances , are good. By this we mean that for any two out of the three parameters the third parameter of the constructed code pair is large. Such pairs of nested codes are indispensable for the determination of good linear ramp secret sharing schemes [35]. They can also be used to ensure reliable communication over asymmetric quantum channels [47]. The new constructions result from carefully applying the Feng-Rao bounds [18,27] to a family of codes defined from multivariate polynomials and Cartesian product point sets.
36 pages
References in corpus (7)
- Relative generalized Hamming weights of one-point algebraic geometric codes
- New Quantum Codes from Evaluation and Matrix-Product Codes
- Stabilizer quantum codes from -affine variety codes and a new Steane-like enlargement
- Feng-Rao decoding of primary codes
- Quantum codes from affine variety codes and their subfield-subcodes
- On the distance of stabilizer quantum codes from -affine variety codes
- Codes for Simultaneous Transmission of Quantum and Classical Information
Cited by in corpus (10)
- Asymmetric entanglement-assisted quantum error-correcting codes and BCH codes
- New binary and ternary LCD codes
- Two Gilbert-Varshamov Type Existential Bounds for Asymmetric Quantum Error-Correcting Codes
- Asymmetric Quantum Concatenated and Tensor Product Codes with Large Z-Distances
- Improved Gilbert-Varshamov Bound for Entanglement-Assisted Asymmetric Quantum Error Correction by Symplectic Orthogonality
- On Steane-Enlargement of Quantum Codes from Cartesian Product Point Sets
- On nested code pairs from the Hermitian curve
- MDS, Hermitian Almost MDS, and Gilbert-Varshamov Quantum Codes from Generalized Monomial-Cartesian Codes
- Steane-Enlargement of Quantum Codes from the Hermitian Curve
- Impure codes exceeding the pure bounds for quantum local recovery