New optimal constructions of conflict-avoiding codes of odd length and weight 3
From MaRDI portal
Publication:404933
DOI10.1007/S10623-013-9827-2zbMATH Open1308.94111OpenAlexW1997513120MaRDI QIDQ404933FDOQ404933
Authors: Chun-e Zhao, Wen-Ping Ma, Dong-Su Shen 
Publication date: 4 September 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9827-2
Recommendations
Cites Work
- Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
- Constant Weight Conflict-Avoiding Codes
- On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
- The 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
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
- 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
Cited In (16)
- Explicit constructions of optimal conflict-avoiding codes
- Optimal equi-difference conflict-avoiding codes of weight four
- Optimal Conflict-Avoiding Codes of Even Length 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
- Optimal strongly conflict-avoiding codes of even length and weight three
- Optimal conflict-avoiding codes for three, four and five active users
- Optimal conflict-avoiding codes of odd length and weight three
- Optimal equi-difference conflict-avoiding codes of odd length and weight three
- Title not available (Why is that?)
- Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes
- Constant Weight Conflict-Avoiding Codes
- On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
- Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
- A new series of optimal tight conflict-avoiding codes of weight 3
- Certain diagonal equations and conflict-avoiding codes of prime lengths
This page was built for publication: New optimal constructions of conflict-avoiding codes of odd length and weight 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404933)
