The best possible upper bound on the probability of undetected error for linear codes of full support

Details The best possible upper bound on the probability of undetected error for linear codes of full support The best possible upper bound on the probability of undetected error for linear codes of full support

2011-02-11

arxiv.org/abs/1102.2350v1

Computer Science

Information Theory

Scientific paper

There is a known best possible upper bound on the probability of undetected error for linear codes. The $[n,k;q]$ codes with probability of undetected error meeting the bound have support of size $k$ only. In this note, linear codes of full support ($=n$) are studied. A best possible upper bound on the probability of undetected error for such codes is given, and the codes with probability of undetected error meeting this bound are characterized.

Affiliated with

Also associated with

No associations

Rating

The best possible upper bound on the probability of undetected error for linear codes of full support 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 The best possible upper bound on the probability of undetected error for linear codes of full support, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The best possible upper bound on the probability of undetected error for linear codes of full support will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-632469