A new series of optimal tight conflict-avoiding codes of weight 3
From MaRDI portal
Publication:507480
DOI10.1016/j.disc.2016.12.003zbMath1393.94934OpenAlexW2569706377MaRDI QIDQ507480
Publication date: 6 February 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.12.003
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal equi-difference conflict-avoiding codes of weight four
- New optimal constructions of conflict-avoiding codes of odd length and weight 3
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
- Conflict-avoiding codes and cyclic triple systems
- Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
- On perfect \(t\)-shift codes in abelian groups
- Some constructions of conflict-avoiding codes
- Optimal conflict-avoiding codes of odd length and weight three
- Optimal equi-difference conflict-avoiding codes of odd length and weight three
- 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
- 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
- Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 3
- Optimal Conflict-Avoiding Codes of Even Length and Weight 3
This page was built for publication: A new series of optimal tight conflict-avoiding codes of weight 3
