RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2002 Volume 38, Issue 4, Pages 24–36 (Mi ppi1323)

This article is cited 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.

UDC: 621.391.15

Received: 14.08.2001
Revised: 18.06.2002


 English version:
Problems of Information Transmission, 2002, 38:4, 268–279

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024