We present two constructions for binary self-orthogonal codes.It turns out that our constructions yield a constructive bound on binary self-orthogonal codes.In particular,when the in-formation rate R=1/2,by our constr...We present two constructions for binary self-orthogonal codes.It turns out that our constructions yield a constructive bound on binary self-orthogonal codes.In particular,when the in-formation rate R=1/2,by our constructive lower bound,the relative minimum distanceδ≈0.0595(for GV bound,δ≈0.110).Moreover,we have proved that the binary self-orthogonal codes asymptotically achieve the Gilbert-Varshamov bound.展开更多
基金supported by the China Scholarship Council,National Natural Science Foundation of China(Grant No.10571026)the Cultivation Fund of the Key Scientific and Technical Innovation Project of Ministry of Education of Chinathe Specialized Research Fund for the Doctoral Program of Higher Education(GrantNo.20060286006)
文摘We present two constructions for binary self-orthogonal codes.It turns out that our constructions yield a constructive bound on binary self-orthogonal codes.In particular,when the in-formation rate R=1/2,by our constructive lower bound,the relative minimum distanceδ≈0.0595(for GV bound,δ≈0.110).Moreover,we have proved that the binary self-orthogonal codes asymptotically achieve the Gilbert-Varshamov bound.
