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

Problemy Peredachi Informatsii

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive
	Impact factor
	Guidelines for authors

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

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

Full-text PDF (2639 kB) Citations (23)

References:

PDF

HTML

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

English version:
Problems of Information Transmission, 2002, Volume 38, Issue 4, Pages 268–279
DOI: https://doi.org/10.1023/A:1022045812079

Bibliographic databases:

Document Type: Article

UDC: 621.391.15

Language: Russian

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

Citation in format AMSBIB

\Bibitem{TsyRub02}

\by B.~S.~Tsybakov, A.~R.~Rubinov

\paper Some Constructions of Conflict-Avoiding Codes

\jour Probl. Peredachi Inf.

\yr 2002

\vol 38

\issue 4

\pages 24--36

\mathnet{http://mi.mathnet.ru/ppi1323}

\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2101739}

\zmath{https://zbmath.org/?q=an:1028.94039}

\transl

\jour Problems Inform. Transmission

\yr 2002

\vol 38

\issue 4

\pages 268--279

\crossref{https://doi.org/10.1023/A:1022045812079}

Linking options:

https://www.mathnet.ru/eng/ppi1323

https://www.mathnet.ru/eng/ppi/v38/i4/p24

This publication is cited in the following 23 articles:

Liang-Chung Hsia, Hua-Chieh Li, Wei-Liang Sun, “Conflict-Avoiding Codes of Prime Lengths and Cyclotomic Numbers”, IEEE Trans. Inform. Theory, 70:10 (2024), 6834
Liang-Chung Hsia, Hua-Chieh Li, Wei-Liang Sun, “Certain diagonal equations and conflict-avoiding codes of prime lengths”, Finite Fields and Their Applications, 92 (2023), 102298
Gianluca De Marco, Dariusz R. Kowalski, Grzegorz Stachowiak, 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), 2021, 1009
Gianluca De Marco, Dariusz R Kowalski, Grzegorz Stachowiak, 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS), 2019, 472
Baicheva Ts.S. Topalova S.T., “Classification of Strongly Conflict-Avoiding Codes”, IEEE Commun. Lett., 22:12 (2018), 2415–2418
Miwako Mishima, Koji Momihara, “A new series of optimal tight conflict-avoiding codes of weight 3”, Discrete Mathematics, 340:4 (2017), 617
Ma W. Zhao Ch.-e. Shen D., “New Optimal Constructions of Conflict-Avoiding Codes of Odd Length and Weight 3”, Des. Codes Cryptogr., 73:3 (2014), 791–804
Fu H.-L. Lo Yu.-H. Shum K.W., “Optimal Conflict-Avoiding Codes of Odd Length and Weight Three”, Des. Codes Cryptogr., 72:2 (2014), 289–309
Lin Y. Mishima M. Satoh J. Jimbo M., “Optimal Equi-Difference Conflict-Avoiding Codes of Odd Length and Weight Three”, Finite Fields their Appl., 26 (2014), 49–68
Shung‐Liang Wu, Hung‐Lin Fu, “Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 3”, J of Combinatorial Designs, 21:6 (2013), 223
Zhang Y., Shum K.W., Wong W.Sh., “Strongly Conflict-Avoiding Codes”, SIAM J Discrete Math, 25:3 (2011), 1035–1053
Kenneth W. Shum, Proceedings of the Fifth International Workshop on Signal Design and Its Applications in Communications, 2011, 134
Shum K.W., Wong W.Sh., Chen Ch.Sh., “A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes”, IEEE Trans Inform Theory, 56:7 (2010), 3265–3276
Hung-Lin Fu, Yi-Hean Lin, Miwako Mishima, “Optimal Conflict-Avoiding Codes of Even Length and Weight 3”, IEEE Trans. Inform. Theory, 56:11 (2010), 5747
Mishima M., Fu Hung-Lin, Uruno Sh., “Optimal conflict-avoiding codes of length $n\equiv 0\pmod{16}$ and weight 3”, Des. Codes Cryptogr., 52:3 (2009), 275–291
V. I. Levenshtein, “Conflict-Avoiding Codes and Cyclic Triple Systems”, Problems Inform. Transmission, 43:3 (2007), 199–212
Momihara K., Müller M., Satoh J., Jimbo M., “Constant weight conflict-avoiding codes”, SIAM J. Discrete Math., 21:4 (2007), 959–979
Momihara K., “Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three”, Des. Codes Cryptogr., 45:3 (2007), 379–390
Jimbo M., Mishima M., Janiszewski S., Teymorian A.Y., Tonchev V.D., “On conflict-avoiding codes of length $n=4m$ for three active users”, IEEE Trans. Inform. Theory, 53:8 (2007), 2732–2742
Momihara K., Mueller M., Satoh J., Jimbo M., “Bounds and constructions for optimal constant weight conflict-avoiding codes”, 2007 IEEE International Symposium on Information Theory Proceedings, 2007, 336–340

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Statistics & downloads:
Abstract page:	447
Full-text PDF :	119
References:	55

Что такое QR-код?

Registration to the website

Logotypes