DocumentCode
2625279
Title
A lower bound on the probability of erasure for an anti-jamming code when used on the binary OR-channel
Author
Hedby, Gunnar
Author_Institution
Nat. Defence Res. Establ., Linkoping, Sweden
fYear
1994
fDate
27 Jun-1 Jul 1994
Firstpage
479
Abstract
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
Keywords
binary sequences; codes; interference suppression; jamming; probability; telecommunication channels; anti-jamming code; binary OR-channel; codeword; coset partitioning; erasure probability; group code; interference; lower bound; Binary codes; Decoding; Gaussian channels; Interference; Jamming;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location
Trondheim
Print_ISBN
0-7803-2015-8
Type
conf
DOI
10.1109/ISIT.1994.395094
Filename
395094
Link To Document