Identification Codes via Prime Numbers
<|reference_start|>Identification Codes via Prime Numbers: 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.<|reference_end|>
@article{zinoghli2024identification,
    title={Identification Codes via Prime Numbers},
    author={Emad Zinoghli and Mohammad Javad Salariseddigh},
    journal={arXiv preprint arXiv:2408.12455},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.12455},
    primaryClass={cs.IT math.IT}
}