Asymptotic bound on binary self-orthogonal codes

DOI10.1007/S11425-008-0133-9zbMath1242.94043arXiv0804.4194OpenAlexW3104917293MaRDI QIDQ1041514

Yang Ding

Publication date: 2 December 2009

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0804.4194

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

Classification of binary self-orthogonal codes of lengths from 16 to 20 and its application

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic function fields and codes
• Uniqueness of some linear subcodes of the extended binary Golay code
• Good self dual codes exist
• Transitive and self-dual codes attaining the Tsfasman-Vla/spl breve/dut$80-Zink bound
• Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound

This page was built for publication: Asymptotic bound on binary self-orthogonal codes