A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
From MaRDI portal
Publication:2638410
DOI10.1007/s10623-009-9345-4zbMath1200.94059OpenAlexW2114771196MaRDI QIDQ2638410
Kenneth W. Shum, Wing Shing Wong
Publication date: 16 September 2010
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-009-9345-4
Related Items
Optimal strongly conflict-avoiding codes of even length and weight three ⋮ 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 = 2k ± 1 and Weight 3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
- On cyclic \(2(k-1)\)-support \((n,k)_{k-1}\) difference families
- Conflict-avoiding codes and cyclic triple systems
- Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
- Abschätzung der asymptotischen Dichte von Summenmengen
- A class of codes for a T active users out of N multiple-access communication system
- 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
- Perfect (d,k)-codes capable of correcting single peak-shifts
- Constructions of protocol sequences for multiple access collision channel without feedback
