Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 (Q735031)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal conflict-avoiding codes of length n 016 and weight 3 |
scientific article; zbMATH DE number 5614978
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 |
scientific article; zbMATH DE number 5614978 |
Statements
Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 (English)
0 references
14 October 2009
0 references
It is well known that conflict-avoiding codes have been studied as protocol sequences for a multiple-access channel (collision channel) without feedback. In this paper, the authors obtain direct constructions for optimal conflict-avoiding codes of length \(n= 16m\) and weight 3 for any \(m\) by utilizing Skolem type sequences. It is also shown that for the case \(n= 16m+8\) Skolem type sequences can give more concise constructions than the ones obtained earlier.
0 references
conflict-avoiding codes
0 references
near-Skolem sequences
0 references
extended Skolem sequences
0 references
extended Langford sequences
0 references
0 references
0 references
