Asymptotic Bound on Binary Self-Orthogonal Codes

Details Asymptotic Bound on Binary Self-Orthogonal Codes Asymptotic Bound on Binary Self-Orthogonal Codes

2008-04-26

arxiv.org/abs/0804.4194v1

Computer Science

Information Theory

4 pages 1 figure

Scientific paper

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 information rate R=1/2, by our constructive lower bound, the relative minimum distance \delta\approx 0.0595 (for GV bound, \delta\approx 0.110). Moreover, we have proved that the binary self-orthogonal codes asymptotically achieve the Gilbert-Varshamov bound.

Affiliated with

Also associated with

No associations

Rating

Asymptotic Bound on Binary Self-Orthogonal Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic Bound on Binary Self-Orthogonal Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic Bound on Binary Self-Orthogonal Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-43328