A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes

DOI10.1109/TIT.2010.2048508zbMath1366.94646arXiv0910.5073MaRDI QIDQ5281394

Chung Shue Chen, Kenneth W. Shum, Wing Shing Wong

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Cyclic codes (94B15)

Related Items (9)

Optimal strongly conflict-avoiding codes of even length and weight three ⋮ New optimal constructions of conflict-avoiding codes of odd length and weight 3 ⋮ Weighted maximum matchings and optimal equi-difference conflict-avoiding codes ⋮ Classification of optimal conflict-avoiding codes of weights 6 and 7 ⋮ Optimal conflict-avoiding codes for three, four and five active users ⋮ Optimal conflict-avoiding codes of odd length and weight three ⋮ Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2^k ± 1 and Weight 3 ⋮ Partially user-irrepressible sequence sets and conflict-avoiding codes ⋮ Optimal equi-difference conflict-avoiding codes of weight four

This page was built for publication: A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes