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

DOI10.1109/TIT.2010.2048508zbMATH Open1366.94646arXiv0910.5073MaRDI QIDQ5281394FDOQ5281394

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

Publication date: 27 July 2017

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

Abstract: Conflict-avoiding codes are used in the multiple-access collision channel without feedback. The number of codewords in a conflict-avoiding code is the number of potential users that can be supported in the system. In this paper, a new upper bound on the size of conflict-avoiding codes is proved. This upper bound is general in the sense that it is applicable to all code lengths and all Hamming weights. Several existing constructions for conflict-avoiding codes, which are known to be optimal for Hamming weights equal to four and five, are shown to be optimal for all Hamming weights in general.

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

Mathematics Subject Classification ID

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

Cited In (10)

• Partially user-irrepressible sequence sets and conflict-avoiding codes
• Optimal equi-difference conflict-avoiding codes of weight four
• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• Optimal strongly conflict-avoiding codes of even length and weight three
• Classification of optimal conflict-avoiding codes of weights 6 and 7
• Optimal conflict-avoiding codes for three, four and five active users
• 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
• Title not available (Why is that?)
• Weighted maximum matchings and optimal equi-difference conflict-avoiding codes

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

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