Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:0910.5073 (cs)
[Submitted on 27 Oct 2009 (v1), last revised 6 Nov 2010 (this version, v3)]

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

Authors:Kenneth W. Shum, Wing Shing Wong, Chung Shue Chen
View PDF
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.
Comments: 10 pages, 1 figure
Subjects: Information Theory (cs.IT)
Cite as: arXiv:0910.5073 [cs.IT]
  (or arXiv:0910.5073v3 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.0910.5073
Journal reference: IEEE Trans. Inform. Theory, vol. 56, no.7, p.3265-3276, Jul, 2010
Related DOI: https://doi.org/10.1109/TIT.2010.2048508

Submission history

From: Kenneth Shum [view email]
[v1] Tue, 27 Oct 2009 09:29:18 UTC (21 KB)
[v2] Wed, 30 Jun 2010 03:51:57 UTC (23 KB)
[v3] Sat, 6 Nov 2010 09:32:23 UTC (23 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2009-10
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Kenneth W. Shum
Wing Shing Wong
Chung Shue Chen
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)