Conflict-avoiding codes and cyclic triple systems
From MaRDI portal
Publication:927474
DOI10.1134/S0032946007030039zbMath1136.94328OpenAlexW2056603816MaRDI QIDQ927474
Publication date: 9 June 2008
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946007030039
Related Items (14)
Optimal strongly conflict-avoiding codes of even length and weight three ⋮ Optimal equi-difference conflict-avoiding codes of odd length and weight three ⋮ A tight asymptotic bound on the size of constant-weight conflict-avoiding codes ⋮ 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 ⋮ 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 ⋮ A new series of optimal tight conflict-avoiding codes of weight 3 ⋮ 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 ⋮ Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 ⋮ Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
Cites Work
- Packet switching in a channel without feedback
- A class of codes for a T active users out of N multiple-access communication system
- 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
This page was built for publication: Conflict-avoiding codes and cyclic triple systems
