A new series of optimal tight conflict-avoiding codes of weight 3
From MaRDI portal
Publication:507480
DOI10.1016/J.DISC.2016.12.003zbMATH Open1393.94934OpenAlexW2569706377MaRDI QIDQ507480FDOQ507480
Authors: Miwako Mishima, Koji Momihara 
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
Recommendations
- Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
- Optimal equi-difference conflict-avoiding codes of odd length and weight three
- Explicit constructions of optimal conflict-avoiding codes
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
- New optimal constructions of conflict-avoiding codes of odd length and weight 3
Cites Work
- Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
- On perfect \(t\)-shift codes in abelian groups
- Optimal conflict-avoiding codes of odd length and weight three
- Optimal equi-difference conflict-avoiding codes of weight four
- Optimal equi-difference conflict-avoiding codes of odd length and weight three
- Constant Weight Conflict-Avoiding Codes
- On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
- The collision channel without feedback
- New optimal constructions of conflict-avoiding codes of odd length and weight 3
- Perfect (d,k)-codes capable of correcting single peak-shifts
- Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
- Optimal Conflict-Avoiding Codes of Even Length and Weight 3
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
- Title not available (Why is that?)
- Constructions of binary constant-weight cyclic codes and cyclically permutable codes
- Constructions of protocol sequences for multiple access collision channel without feedback
- Conflict-avoiding codes and cyclic triple systems
- Some constructions of conflict-avoiding codes
- Title not available (Why is that?)
- A class of codes for a T active users out of N multiple-access communication system
- A Wieferich prime search up to \(6.7 \times 10^{15}\)
Cited In (6)
- Optimal Conflict-Avoiding Codes of Even Length and Weight 3
- Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
- Title not available (Why is that?)
- On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
- Certain diagonal equations and conflict-avoiding codes of prime lengths
- Multichannel Conflict-Avoiding Codes of Weights Three and Four
Uses Software
This page was built for publication: A new series of optimal tight conflict-avoiding codes of weight 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507480)
