Abstract
Existing tables of constant weight codes are mainly confined to codes of length
n ≤ 28. This paper presents tables of codes of lengths 29 ≤ n ≤ 63. The motivation for creating these tables was their application to the generation of good sets of frequency hopping lists in radio networks. The complete generation of all relevant cases by a small number of algorithms is augmented in individual cases by miscellaneous constructions. These sometimes give a larger number of codewords than the algorithms.
n ≤ 28. This paper presents tables of codes of lengths 29 ≤ n ≤ 63. The motivation for creating these tables was their application to the generation of good sets of frequency hopping lists in radio networks. The complete generation of all relevant cases by a small number of algorithms is augmented in individual cases by miscellaneous constructions. These sometimes give a larger number of codewords than the algorithms.
| Original language | English |
|---|---|
| Article number | A2 |
| Journal | The Electronic Journal of Combinatorics |
| Volume | 13 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 12 May 2006 |