316 citations
- Vaisala (Finland)FI8 papers
- Slovak Academy of SciencesSK7 papers
- Metsähallitus (Finland)FI5 papers
- University of HelsinkiFI5 papers
- Michigan State UniversityUS4 papers
- University of AucklandNZ4 papers
- University of GenoaIT4 papers
- Åbo Akademi UniversityFI3 papers
- AlbaNovaSE3 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di GenovaIT3 papers
- Queen's University BelfastGB3 papers
- The University of Texas at AustinUS3 papers
Showing math.COShow all
2 papers · 1 filter
math.CO2008
On the size of identifying codes in binary hypercubes
Svante Janson, Tero Laihonen
We consider identifying codes in binary Hamming spaces F^n, i.e., in binary hypercubes. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 199…
math.CO2003★ 3 cited
Polynomial versus Exponential Growth in Repetition-Free Binary Words
Juhani Karhumaki, Jeffrey Shallit
It is known that the number of overlap-free binary words of length n grows polynomially, while the number of cubefree binary words grows exponentially. We show that the dividing li…