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

DOI10.1007/S10623-007-9139-5zbMATH Open1178.94240OpenAlexW1977550436MaRDI QIDQ1008958FDOQ1008958

Authors: 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

Recommendations

• Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
• A new series of optimal tight conflict-avoiding codes of weight 3
• Optimal equi-difference conflict-avoiding codes of odd length and weight three
• Optimal strongly conflict-avoiding codes of even length and weight three
• Optimal Conflict-Avoiding Codes of Even Length and Weight 3
• Optimal conflict-avoiding codes of odd length and weight three
• Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
• The \(t\)-wise intersection of relative three-weight codes
• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• Three-weight ternary linear codes from a family of cyclic difference sets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Combinatorial codes (94B25) Applications of design theory to circuits and networks (94C30)

Cites Work

• 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
• Classical theory of algebraic numbers
• Conflict-avoiding codes and cyclic triple systems
• Optical orthogonal codes-new bounds and an optimal construction
• Optical orthogonal codes: design, analysis and applications
• Some constructions of conflict-avoiding codes
• A class of codes for a T active users out of N multiple-access communication system
• A powerful method for constructing difference families and optimal optical orthogonal codes
• Sums of Gauss, Jacobi, and Jacobsthal
• The 2r-th power character of 2.
• Rational reciprocity laws

Cited In (17)

• Optimal equi-difference conflict-avoiding codes of weight four
• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) 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})\}}\)
• 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
• Optimal conflict-avoiding codes of odd length and weight three
• Optimal equi-difference conflict-avoiding codes of odd length and weight three
• Some progress on optimal 2-D \((n\times m,3,2,1) \)-optical orthogonal codes
• Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes
• A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
• 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
• Constructions of optimal variable-weight OOCs via quadratic residues
• On cyclic \(2(k-1)\)-support \((n,k)_{k-1}\) difference families

This page was built for publication: Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008958)