Optimal strongly conflict-avoiding codes of even length and weight three

DOI10.1007/s10623-015-0057-7zbMath1405.94132arXiv1406.6210OpenAlexW3098047458MaRDI QIDQ285257

Wing Shing Wong, Yijin Zhang, Yuan-Hsun Lo

Publication date: 19 May 2016

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

Full work available at URL: https://arxiv.org/abs/1406.6210

zbMATH Keywords

conflict-avoiding codeprotocol sequencestrongly conflict-avoiding code

Mathematics Subject Classification ID

Applications of design theory to circuits and networks (94C30) Combinatorial codes (94B25)

Cites Work

• 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
• Strongly Conflict-Avoiding Codes
• Constant Weight Conflict-Avoiding Codes
• New Protocol Sequences for Random-Access Channels Without Feedback
• On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
• The collision channel without feedback
• Constructions of binary constant-weight cyclic codes and cyclically permutable codes
• 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
• Shift-Invariant Protocol Sequences for the Collision Channel Without Feedback
• Optimal Conflict-Avoiding Codes of Even Length and Weight 3
• Construction and Applications of CRT Sequences
• A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes

This page was built for publication: Optimal strongly conflict-avoiding codes of even length and weight three