Identification Codes via Prime Numbers
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914920873852928 |
|---|---|
| author | Zinoghli, Emad Salariseddigh, Mohammad Javad |
| author_facet | Zinoghli, Emad Salariseddigh, Mohammad Javad |
| contents | We introduce a method for construction of identification codes based on prime number generation over the noiseless channels. The earliest method for such construction based on prime numbers was proposed by Ahlswede which relies on algorithms for generation of prime numbers. This method requires knowledge of $2^n$ first prime numbers for identification codes with block length $n,$ which is not computationally efficient. In this work, we revisit Ahlswede's scheme and propose a number of modifications. In particular, employing probabilistic prime generation algorithm, we guarantee that the prime keys generation is possible in polynomial time. Furthermore, additional improvements in terms of type II upper bound are derived and presented. Finally, we propose a method for identification coding based on hash functions which generalizes the Ahlswede's scheme. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_12455 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Identification Codes via Prime Numbers Zinoghli, Emad Salariseddigh, Mohammad Javad Information Theory We introduce a method for construction of identification codes based on prime number generation over the noiseless channels. The earliest method for such construction based on prime numbers was proposed by Ahlswede which relies on algorithms for generation of prime numbers. This method requires knowledge of $2^n$ first prime numbers for identification codes with block length $n,$ which is not computationally efficient. In this work, we revisit Ahlswede's scheme and propose a number of modifications. In particular, employing probabilistic prime generation algorithm, we guarantee that the prime keys generation is possible in polynomial time. Furthermore, additional improvements in terms of type II upper bound are derived and presented. Finally, we propose a method for identification coding based on hash functions which generalizes the Ahlswede's scheme. |
| title | Identification Codes via Prime Numbers |
| topic | Information Theory |
| url | https://arxiv.org/abs/2408.12455 |