Optimal conflict-avoiding codes of length n 016 and weight 3
From MaRDI portal
Publication:735031
DOI10.1007/S10623-009-9282-2zbMATH Open1178.94255OpenAlexW2034700817MaRDI QIDQ735031FDOQ735031
Authors: Miwako Mishima, Hung-Lin Fu, Shoichi Uruno 
Publication date: 14 October 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-009-9282-2
Recommendations
- Explicit constructions of optimal conflict-avoiding codes
- New optimal constructions of conflict-avoiding codes of odd length and weight 3
- Constant Weight Conflict-Avoiding Codes
- scientific article; zbMATH DE number 6500353
- Optimal equi-difference conflict-avoiding codes of odd length and weight three
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
- 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
- Extended skolem sequences
- 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
- Extended Langford sequences with small defects
Cited In (29)
- 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
- New optimal constructions of conflict-avoiding codes of odd length and weight 3
- Some infinite classes of optimal \({(v,\{3,4\},1,Q)}\)-OOCs with \({Q\in\{(\frac{1}{3},\frac{2}{3}),(\frac{2}{3},\frac{1}{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 tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
- Some constructions of conflict-avoiding codes
- Optimal conflict-avoiding codes of odd length and weight three
- Further results on balanced \((n, \{3, 4 \}, \Lambda_a, 1)\)-OOCs
- Optimal equi-difference conflict-avoiding codes of odd length and weight three
- Title not available (Why is that?)
- Optimal \((v,5,2,1)\) optical orthogonal codes of small \(v\)
- Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one
- A few more optimal optical orthogonal codes with non-constant auto-correlation function
- New results on optimal \((v,4,2,1)\) optical orthogonal codes
- Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes
- On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
- A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
- Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
- On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16
- A new series of optimal tight conflict-avoiding codes of weight 3
- Certain diagonal equations and conflict-avoiding codes of prime lengths
- Bounds and constructions on \((v,4,3,2)\) optical orthogonal codes
- Constructions of optimal variable-weight OOCs via quadratic residues
- Further results on optimal \((v,4,2,1)\)-OOCs
- On optimal \((v,5,2,1)\) optical orthogonal codes
This page was built for publication: Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735031)
