Weighted maximum matchings and optimal equi-difference conflict-avoiding codes

DOI10.1007/S10623-014-9961-5MaRDI QIDQ498989zbMATH OpenOpenAlexFDO

Authors Yuan-Hsun Lo, Hung-Lin Fu, Yi-Hean Lin

Publication date 29 September 2015

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-014-9961-5

zbMATH Keywords

conflict-avoiding codeweighted matchingequi-difference conflict-avoiding code

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial codes (94B25) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Optimal equi-difference conflict-avoiding codes of weight four
• Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) 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
• Constant Weight Conflict-Avoiding Codes

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
• Conflict-avoiding codes and cyclic triple systems
• Constant Weight Conflict-Avoiding Codes
• Constructions of protocol sequences for multiple access collision channel without feedback
• 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
• 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
• The On-Line Encyclopedia of Integer Sequences

Cited in

(2)

• Optimal equi-difference conflict-avoiding codes of weight four
• Weighted external difference families and R-optimal AMD codes

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Weighted maximum matchings and optimal equi-difference conflict-avoiding codes

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