By Topic

A lower bound on the probability of erasure for an anti-jamming code when used on the binary OR-channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Hedby, G. ; Nat. Defence Res. Establ., Linkoping, Sweden

An anti-jamming code consists of a set of codes obtained from the coset partitioning of a larger code. The code is used over a binary OR-channel subject to intentional interference. We derive a lower bound on the probability of erasing a codeword

Published in:

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Date of Conference:

27 Jun-1 Jul 1994