Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3

DOI10.1007/S10623-009-9282-2zbMath1178.94255OpenAlexW2034700817MaRDI QIDQ735031

Hung-Lin Fu, Miwako Mishima, 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

zbMATH Keywords

conflict-avoiding codesextended Langford sequencesextended Skolem sequencesnear-Skolem sequences

Mathematics Subject Classification ID

Bounds on codes (94B65) Combinatorial codes (94B25)

Related Items (21)

Optimal strongly conflict-avoiding codes of even length and weight three ⋮ Optimal equi-difference conflict-avoiding codes of odd length and weight three ⋮ 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})\}}\) ⋮ A tight asymptotic bound on the size of constant-weight conflict-avoiding codes ⋮ Bounds and Constructions on (v, 4, 3, 2) Optical Orthogonal Codes ⋮ Optimal \((v,5,2,1)\) optical orthogonal codes of small \(v\) ⋮ Constructions of optimal variable-weight OOCs via quadratic residues ⋮ 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 ⋮ New results on optimal \((v,4,2,1)\) optical orthogonal codes ⋮ On optimal \((v,5,2,1)\) optical orthogonal codes ⋮ Further results on balanced \((n, \{3, 4 \}, \Lambda_a, 1)\)-OOCs ⋮ Further results on optimal \((v,4,2,1)\)-OOCs ⋮ Weighted maximum matchings and optimal equi-difference conflict-avoiding codes ⋮ 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 = 2^k ± 1 and Weight 3 ⋮ Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one ⋮ Optimal equi-difference conflict-avoiding codes of weight four

Cites Work

• Unnamed Item
• Conflict-avoiding codes and cyclic triple systems
• Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
• Extended Langford sequences with small defects
• Some constructions of conflict-avoiding codes
• 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
• Constructions of protocol sequences for multiple access collision channel without feedback
• Extended skolem sequences

This page was built for publication: Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3