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

DOI10.1134/S0032946017010033MaRDI QIDQ1752295zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Classification of optimal conflict-avoiding codes of weights 6 and 7
• scientific article; zbMATH DE number 6500353
• Constant Weight Conflict-Avoiding Codes
• Explicit constructions of optimal conflict-avoiding codes
• On Conflict-Avoiding Codes of Length n=4m for Three Active Users

Cites work

• A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
• A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
• Classification of maximal optical orthogonal codes of weight 3 and small lengths
• Conflict-avoiding codes and cyclic triple systems
• Constant Weight Conflict-Avoiding Codes
• scientific article; zbMATH DE number 3867218 (Why is no real title available?)
• Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• On Conflict-Avoiding Codes of Length n=4m for Three Active Users
• Optical orthogonal codes: design, analysis and applications
• Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters
• Optimal (v,5,2,1) optical orthogonal codes of small v
• Optimal Conflict-Avoiding Codes of Even Length and Weight 3
• Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
• Optimal conflict-avoiding codes of odd length and weight three
• Optimal equi-difference conflict-avoiding codes of odd length and weight three
• Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3

Cited in

(7)

• Classification of optimal conflict-avoiding codes of weights 6 and 7
• Some constructions of conflict-avoiding codes
• Partially user-irrepressible sequence sets and conflict-avoiding codes
• Optimal strongly conflict-avoiding codes of even length and weight three
• Explicit constructions of optimal conflict-avoiding codes
• A class of codes for a T active users out of N multiple-access communication system
• On Conflict-Avoiding Codes of Length n=4m for Three Active Users

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752295)