Bounds on the worst case probability of undetected error

Authors:
T. Klove
Affiliations:
Dept. of Inf., Bergen Univ.
Venue:
IEEE Transactions on Information Theory
Year:
1995

Citing 0
Cited 2

Uniform asymptotics of some Abel sums arising in coding theory

Theoretical Computer Science
On some properties of the NML estimator for Bernoulli strings

Information Processing Letters

Quantified Score

Hi-index	754.84

Visualization

Abstract

Upper and lower bounds on the average worst-case probability of undetected error for linear [n,k,q] codes are given