Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint

  • S. Csibi
  • E. von der Meulen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4123)


It is well-known from pioneering papers published since 1989 that, for identification via a communication channel of given Shannon capacity \({\cal C}\), the number N(n) of messages which can be reliably identified using an identification code grows doubly exponentially with the wordlength n, as n→∞. This paper provides contributions to the study of identification plus transmission (IT) codes under a wordlength constraint nn 0 for sending an identifier and message content over a noiseless one-way channel. While the false identification probability no longer vanishes under such constraint, it can be drastically suppressed both by serial and parallel versions of an appropriately defined non-algebraic forward error control (FEC). The main result of this paper consists of exact and approximate expressions for the huge size N(n), and the corresponding second-order rate, of an asymptotically optimal IT code sequence under a wordlength constraint, both with and without either of the two proposed FEC schemes. Also, upper bounds are obtained on the false identification probability under such wordlength constraint for both FEC versions, showing the drastic reduction possible when applying FEC. Furthermore, it is outlined in this paper how the simultaneous transfer of identifiers and message contents by several active users via a noiseless multiple access channel (MAC) could be handled, using the concept of a least length single control sequence. Huge size identifier sets might be of design interest for certain prospective remote alarm services, such as when occasional alarm services are to be conveyed via a simple MAC which is controlled by the same single common cyclically permutable sequence at all nodes involved. It is pointed out under which circumstances the use of huge IT codes might be worth further detailed investigation by designers interested in such prospective services.


Multiple Access Forward Error Correction Control Sequence Parallel Channel Message Content 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A, N.Q., Györfi, L., Massey, J.L.: Construction of binary constant-weight cyclic codes and cyclically permutable codes. IEEE Trans. Inform. Theory 38, 940–949 (1992)Google Scholar
  2. 2.
    Abramson, N.: Development of ALOHANET. IEEE Trans. Inform. Theory 31, 119–123 (1985)MATHCrossRefGoogle Scholar
  3. 3.
    Abramson, N.: Multiple access in wireless digital networks. Proc. IEEE 82, 1360–1370 (1994)CrossRefGoogle Scholar
  4. 4.
    Ahlswede, R.: General theory of information transfer, Preprint 97–118, SFB 343 Diskrete Strukturen in der Mathematik, Universität Bielefeld (1997); General theory of information transfer: updated, General Theory of Information Transfer and Combinatorics, a Special Issue of Discrete Applied Mathematics (to appear)Google Scholar
  5. 5.
    Ahlswede, R., Dueck, G.: Identification via channels. IEEE Trans Inform. Theory 35, 15–29 (1989)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Ahlswede, R., Verboven, B.: On identification via multi-way channels with feedback. IEEE Trans. Inform. Theory 37, 1519–1526 (1991)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Bassalygo, L.A., Pinsker, M.S.: Limited multiple-access to an asynchronous channel (in Russian). Problemy Peredachi Informatsii 19(4), 92–96 (1983)MATHGoogle Scholar
  8. 8.
    Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, New Jersey (1987)Google Scholar
  9. 9.
    Csibi, S.: Two-sided bounds on the decoding error probability for structured hopping, single common sequence and a Poisson population. In: Proc. 1994 IEEE Internat. Symp. Inform. Theory, Trondheim, p. 290 (1994)Google Scholar
  10. 10.
    Csibi, S.: On the decoding error probability of slotted asynchronous access and least length single sequence hopping, Preprint, Dept. Telecomm., Tech. Univ. Budapest, pp. 1–54 (1997)Google Scholar
  11. 11.
    Csibi, S., van der Meulen, E.C.: Properties of codes for identification via a multiple access channel under a word-length constraint, Preprint (A previous version of the present paper, distributed at the Preparatory Meeting, ZiF, Uni-Bielefeld, February 18-23, 2002, includes results achieved until that date only), pp. 1–8 (2002)Google Scholar
  12. 12.
    Forney Jr., G.D.: Concatenated Codes. MIT Press, Cambridge (1966)Google Scholar
  13. 13.
    Forney Jr., G.D., Ungerboeck, G.: Modulation and coding for linear Gaussian channels. IEEE Trans. Inform. Theory, Commemorative Issue 1948-1998 44, 2384–2415 (1998)Google Scholar
  14. 14.
    Han, T.S., Verdú, S.: New results in the theory of identification via channels. IEEE Trans. Inform. Theory 38, 14–25 (1992)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Han, T.S., Verdú, S.: Approximation theory of output statistics. IEEE Trans. Inform. Theory 39, 752–772 (1993)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Lin, S., Costello, D.J.: Error Control Coding. Prentice-Hall, New Jersey (1983)Google Scholar
  17. 17.
    Massey, J.L., Mathys, P.: The collision channel without feedback. IEEE Trans. Inform. Theory 31, 192–204 (1985)MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Pap, L.: Performance analysis of DS unslotted packet radio networks with given auto- and crosscorrelation sidelobes. In: Proc. IEEE 3rd Internat. Symp. Spread Spectrum Techniques and Applications, Oulu, Finland, pp. 343–345 (1994)Google Scholar
  19. 19.
    Sós, V.T.: An additive problem in different structures (a survey). In: Proc. 2nd Internat. Conf. Graph Theory, Combinatorics, Algorithms, and Applications. SIAM, Philadelphia (1991)Google Scholar
  20. 20.
    Tsybakov, B.S., Likhanov, N.B.: Packet communication on a channel with feedback. Probl. Inform. Transm. 19(2), 69–84 (1983)MathSciNetGoogle Scholar
  21. 21.
    van der Meulen, E.C., Csibi, S.: Identification coding for least length single sequence hopping, Abstracts. In: 1996 IEEE Inform. Theory Workshop, Dan-Carmel, Haifa, p. 67 (1996)Google Scholar
  22. 22.
    van der Meulen, E.C., Csibi, S.: Elementary forward error control for identification codes. In: Proc. 1997 IEEE Intern. Symp. Inform. Theory, Ulm, p. 160 (1997)Google Scholar
  23. 23.
    van der Meulen, E.C., Csibi, S.: Error probabilities for identification coding and least length single sequence hopping. In: Althöfer, I., Cai, N., Dueck, G., Khachatrian, L., Pinsker, M.S., Sárközy, A., Wegener, I., Zhang, Z. (eds.) Numbers, Information and Complexity, special volume in honour of R. Ahlswede on occasion of his 60th birthday, pp. 221–238. Kluwer Academic Publishers, Boston (2000)Google Scholar
  24. 24.
    Verdú, S., Wei, V.K.: Explicit constructions of constant-weight codes for identification via channels. IEEE Trans. Inform. Theory 39, 30–36 (1993)MATHCrossRefMathSciNetGoogle Scholar
  25. 25.
    Wolfowitz, J.: Coding Theorems of Information Theory, 3rd edn. Springer, New York (1978)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • S. Csibi
  • E. von der Meulen

There are no affiliations available

Personalised recommendations