Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three

DOI10.1007/s10623-007-9139-5zbMath1178.94240MaRDI QIDQ1008958

Koji Momihara

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-007-9139-5

Mathematics Subject Classification ID

11B75: Other combinatorial number theory

94C30: Applications of design theory to circuits and networks

94B25: Combinatorial codes

Related Items

Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2^k ± 1 and Weight 3, Certain diagonal equations and conflict-avoiding codes of prime lengths, Some progress on optimal 2-D \((n\times m,3,2,1) \)-optical orthogonal codes, Optimal equi-difference conflict-avoiding codes of weight four, Optimal strongly conflict-avoiding codes of even length and weight three, Constructions of optimal variable-weight OOCs via quadratic residues, New optimal constructions of conflict-avoiding codes of odd length and weight 3, 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 of length \(n\equiv 0\pmod{16}\) and weight 3, On cyclic \(2(k-1)\)-support \((n,k)_{k-1}\) difference families, Optimal conflict-avoiding codes for three, four and five active users, Optimal conflict-avoiding codes of odd length and weight three, Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes, 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

Cites Work

• Conflict-avoiding codes and cyclic triple systems
• Sums of Gauss, Jacobi, and Jacobsthal
• A powerful method for constructing difference families and optimal optical orthogonal codes
• Some constructions of conflict-avoiding codes
• A class of codes for a T active users out of N multiple-access communication system
• Optical orthogonal codes-new bounds and an optimal construction
• Constant Weight Conflict-Avoiding Codes
• On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
• The collision channel without feedback
• Optical orthogonal codes: design, analysis and applications
• The 2r-th power character of 2.
• Rational reciprocity laws
• Constructions of binary constant-weight cyclic codes and cyclically permutable codes
• Constructions of protocol sequences for multiple access collision channel without feedback
• Classical theory of algebraic numbers