Error Probabilities for Identification Coding and Least Length Single Sequence Hopping
Upper and lower bounds on the probabilities of the missed and the false identification are proved for Poisson population, for multiple access with least length single sequence hopping, and identification plus transmission coding at each potential source. False identification due to possible worst pairs of identifiers is considered. It is shown, how can one drastically suppress the probability of this event provided not just a single code word but at least a couple of code words might be sent from each source, following each demand, consecutively. An approriate kind of randomization is assumed for this purpose, frequently needed anyhow. The combination of identification plus transmission coding and single sequence hopping might be appealing for certain tasks of identification through a multiple access channel. This might be the case, e.g., for certain public emergency services, meant to convey within some area many kinds of occasional demands from a vast population of potential sources, each sending a very short message following a demand, very infrequently.
KeywordsSingle Sequence Code Word False Identification Multiple Access Channel Message Block
Unable to display preview. Download preview PDF.
- R. Ahlswede, “General Theory of Information Transfer,” Preprint 97–118, Sonderforschungsbereich 343, Diskrete Strukturen in der Mathematik Universität Bielefeld, D, 1997.Google Scholar
- L. Pap, “Performance analysis of DS unslotted packet radio networks with given auto- and crosscorrelation sidelobes,” Proc. IEEE Third Internat. Symp. Spread Spectrum Techniques and Applications, Oulu, Finland, 1994, pp. 343–345.Google Scholar
- S. Csibi, “Two-sided bounds on the decoding error probability for structured hopping, single common sequence and Poisson population,” Proc. 1994 IEEE Internat. Symp. on Inform. Theory, Trondheim, 1994, p. 290.Google Scholar
- E. C. van der Meulen and S. Csibi, “Identification coding for least length single sequence hopping,” Abstracts, 1996 IEEE Information Theory Workshop, Dan-Carmel, Haifa, 1996, p. 67.Google Scholar
- Q.A. Nguyen, L. Györfi, and J.L.Massey. “Constructions of binary constant weight cyclic codes and cyclically permutable codes,” IEEE Trans. on Inform Theory, IT-38, 1992, pp. 940–949.Google Scholar
- S. Csibi, “On the decoding error probability of slotted asynchronous access and least length single sequence hopping,” Preprint, 1997.Google Scholar
- S. Csibi, “On the decoding error probability of truly asynchronous least length single sequence hopping,” Preprint, 1997.Google Scholar