|
Problemy Peredachi Informatsii, 2002, Volume 38, Issue 4, Pages 24–36
(Mi ppi1323)
|
|
|
|
This article is cited in 23 scientific papers (total in 23 papers)
Information Theory and Coding Theory
Some Constructions of Conflict-Avoiding Codes
B. S. Tsybakov, A. R. Rubinov
Abstract:
Constructions of conflict-avoiding codes are presented. These codes can be used as protocol sequences for successful packet transmission over a collision channel without feedback. We give a relation between codes that avoid conflicts of different numbers of colliding users. Upper bounds on the maximum code size and three particular code constructions are presented.
Received: 14.08.2001 Revised: 18.06.2002
Citation:
B. S. Tsybakov, A. R. Rubinov, “Some Constructions of Conflict-Avoiding Codes”, Probl. Peredachi Inf., 38:4 (2002), 24–36; Problems Inform. Transmission, 38:4 (2002), 268–279
Linking options:
https://www.mathnet.ru/eng/ppi1323 https://www.mathnet.ru/eng/ppi/v38/i4/p24
|
Statistics & downloads: |
Abstract page: | 424 | Full-text PDF : | 111 | References: | 48 |
|