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

DOI10.1007/S10623-014-9961-5zbMath1360.94418OpenAlexW2028401261MaRDI QIDQ498989

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

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) Applications of graph theory to circuits and networks (94C15) Combinatorial codes (94B25)

Uses Software

• OEIS

Cites Work

• 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
• The On-Line Encyclopedia of Integer Sequences
• 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
• Constant Weight Conflict-Avoiding Codes
• On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
• Constructions of protocol sequences for multiple access collision channel without feedback
• 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: Weighted maximum matchings and optimal equi-difference conflict-avoiding codes