Constructions of binary quantum CSS-T codes from some special functions

DOI10.3934/AMC.2026003MaRDI QIDQ6852064zbMATH OpenFDO

Authors Bin Zheng, Shixin Zhu

Publication date 26 February 2026

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2026003

zbMATH Keywords

Boolean functionsCSS-T codesfault tolerancequantum error correcting codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Computational stability and error-correcting codes for quantum computation and communication processing (81P73) Linear codes (general theory) (94B05)

Cites work

• A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
• A family of projective two-weight linear codes
• An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance
• Binary Linear Codes With Few Weights From Two-to-One Functions
• Cyclotomic Linear Codes of Order 3
• Fundamentals of Error-Correcting Codes
• Further Study of 2-to-1 Mappings Over F_2ⁿ
• Good quantum error-correcting codes exist
• Linear Codes From Some 2-Designs
• Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
• Multiple-particle interference and quantum error correction
• Nonbinary quantum stabilizer codes
• Nonbinary Stabilizer Codes Over Finite Fields
• Projective binary linear codes from special Boolean functions
• Quantum error correction via codes over GF(4)
• Several Families of Binary Minimal Linear Codes From Two-to-One Functions
• Structure of CSS and CSS-T quantum codes
• Three-weight cyclic codes and their weight distributions
• Two-to-one mappings and involutions without fixed points over \(\mathbb{F}_{2^n}\)

This page was built for publication: Constructions of binary quantum CSS-T codes from some special functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852064)