Some constructions of conflict-avoiding codes

DOI10.1023/A:1022045812079zbMath1028.94039OpenAlexW186304936MaRDI QIDQ1812368

A. R. Rubinov, B. S. Tsybakov

Publication date: 19 June 2003

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022045812079

zbMATH Keywords

synchronizationconflict-avoiding codespacket transmissioncollision channelprotocol sequences

Mathematics Subject Classification ID

Bounds on codes (94B65) Cyclic codes (94B15) Channel models (including quantum) in information and communication theory (94A40) Synchronization error-correcting codes (94B50)

Related Items (8)

Optimal equi-difference conflict-avoiding codes of odd length and weight three ⋮ Certain diagonal equations and conflict-avoiding codes of prime lengths ⋮ New optimal constructions of conflict-avoiding codes of odd length and weight 3 ⋮ A new series of optimal tight conflict-avoiding codes of weight 3 ⋮ Optimal conflict-avoiding codes of odd length and weight three ⋮ Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2^k ± 1 and Weight 3 ⋮ Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 ⋮ Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three

This page was built for publication: Some constructions of conflict-avoiding codes