Optimal conflict-avoiding codes for three, four and five active users

DOI10.1134/S0032946017010033zbMath1387.94127OpenAlexW2605422618MaRDI QIDQ1752295

Svetlana Topalova, Tsonka Stefanova Baicheva

Publication date: 24 May 2018

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

Full work available at URL: https://doi.org/10.1134/s0032946017010033

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Related Items (1)

Classification of optimal conflict-avoiding codes of weights 6 and 7

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal \((v,5,2,1)\) optical orthogonal codes of small \(v\)
• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
• Conflict-avoiding codes and cyclic triple systems
• Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
• Optimal conflict-avoiding codes of odd length and weight three
• Optimal equi-difference conflict-avoiding codes of odd length and weight three
• A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
• Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters
• Constant Weight Conflict-Avoiding Codes
• On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
• Optical orthogonal codes: design, analysis and applications
• Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2^k ± 1 and Weight 3
• Optimal Conflict-Avoiding Codes of Even Length and Weight 3
• A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes

This page was built for publication: Optimal conflict-avoiding codes for three, four and five active users