On cyclic \(2(k-1)\)-support \((n,k)_{k-1}\) difference families

DOI10.1016/j.ffa.2009.02.003zbMath1175.05024OpenAlexW1996869727MaRDI QIDQ841233

Koji Momihara

Publication date: 15 September 2009

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2009.02.003

zbMATH Keywords

conflict-avoiding codeoptical orthogonal codecyclic \(\delta \)-support \((n, k)_\mu\) difference familyKronecker density

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial codes (94B25)

Related Items (9)

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 ⋮ Optimal \((v,5,2,1)\) optical orthogonal codes of small \(v\) ⋮ Constructions of optimal variable-weight OOCs via quadratic residues ⋮ 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 ⋮ Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2^k ± 1 and Weight 3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
• Some combinatorial constructions for optical orthogonal codes
• Some progress on \((v,4,1)\) difference families and optical orthogonal codes
• Constructions of \((q,k,1)\) difference families with \(q\) a prime power and \(k=4,5\)
• Optical orthogonal codes: their bounds and new optimal constructions
• Optimal (9v, 4, 1) Optical Orthogonal 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
• A packing problem its application to Bose's families
• Existence of (q,k, 1) difference families withq a prime power andk = 4, 5
• Combinatorial constructions of optimal optical orthogonal codes with weight 4
• Bounds and Constructions of Optimal ($n, 4, 2, 1$) Optical Orthogonal Codes
• Classical theory of algebraic numbers

This page was built for publication: On cyclic \(2(k-1)\)-support \((n,k)_{k-1}\) difference families