A4 Vertaisarvioitu artikkeli konferenssijulkaisussa
Improved Bounds on Binary Identifying Codes
Tekijät: Exoo G, Junnila V, Laihonen T, Ranto S
Julkaisuvuosi: 2008
Tietokannassa oleva lehden nimi: 2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6
Aloitussivu: 629
Lopetussivu: 633
Sivujen määrä: 2
ISBN: 978-1-4244-2256-2
DOI: https://doi.org/10.1109/ISIT.2008.4595062
Tiivistelmä
In this paper we consider identifying codes in Hamming spaces. We first concentrate on improving the lower bounds on codes which identify words within distance r > 1. These improvements are achieved using a new approach. Then we proceed by introducing new lower bounds on codes identifying sets of words. Constructions for such codes with the best known cardinatities are also given.
In this paper we consider identifying codes in Hamming spaces. We first concentrate on improving the lower bounds on codes which identify words within distance r > 1. These improvements are achieved using a new approach. Then we proceed by introducing new lower bounds on codes identifying sets of words. Constructions for such codes with the best known cardinatities are also given.
Turun yliopiston Tutkimustietojärjestelmän portaali