Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 3
From MaRDI portal
Publication:4929280
DOI10.1002/jcd.21332zbMath1297.94126OpenAlexW1933645118MaRDI QIDQ4929280
Publication date: 13 June 2013
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21332
Related Items (9)
Optimal strongly conflict-avoiding codes of even length and weight three ⋮ Optimal equi-difference conflict-avoiding codes of odd length and weight three ⋮ Certain diagonal equations and conflict-avoiding codes of prime lengths ⋮ Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes ⋮ Some progress on optimal 2-D \((n\times m,3,2,1) \)-optical orthogonal codes ⋮ Weighted maximum matchings and optimal equi-difference conflict-avoiding codes ⋮ A new series of optimal tight conflict-avoiding codes of weight 3 ⋮ Optimal conflict-avoiding codes for three, four and five active users ⋮ Optimal equi-difference conflict-avoiding codes of weight four
Cites Work
- 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
- Some constructions of conflict-avoiding codes
- Optimal conflict-avoiding codes of odd length and weight three
- A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
- A class of codes for a T active users out of N multiple-access communication system
- Constant Weight Conflict-Avoiding Codes
- On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
- Constructions of binary constant-weight cyclic codes and cyclically permutable codes
- Constructions of protocol sequences for multiple access collision channel without feedback
- Optimal Conflict-Avoiding Codes of Even Length and Weight 3
- A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
This page was built for publication: Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 3
