On cyclic 2(k-1)-support (n,k)_k-1 difference families

DOI10.1016/J.FFA.2009.02.003MaRDI QIDQ841233zbMATH OpenOpenAlexFDO

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

Recommendations

• Complete sets of disjoint difference families and their applications
• 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\)
• On the existence of some cyclic difference families and difference matrices
• A lower bound for cardinality of a class of cyclic difference families

Cites work

• scientific article; zbMATH DE number 3480541 (Why is no real title available?)
• scientific article; zbMATH DE number 1342086 (Why is no real title available?)
• scientific article; zbMATH DE number 1080076 (Why is no real title available?)
• scientific article; zbMATH DE number 3031875 (Why is no real title available?)
• A class of codes for a T active users out of N multiple-access communication system
• A packing problem its application to Bose's families
• Bounds and Constructions of Optimal ($n, 4, 2, 1$) Optical Orthogonal Codes
• Classical theory of algebraic numbers
• Combinatorial constructions of optimal optical orthogonal codes with weight 4
• Constant Weight Conflict-Avoiding Codes
• Constructions of \((q,k,1)\) difference families with \(q\) a prime power and \(k=4,5\)
• Existence of (q,k, 1) difference families withq a prime power andk = 4, 5
• Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
• On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
• Optical orthogonal codes: Their bounds and new optimal constructions
• Optimal \((9v,4,1)\) optical orthogonal codes
• Some combinatorial constructions for optical orthogonal codes
• Some progress on (v,4,1) difference families and optical orthogonal codes
• The collision channel without feedback

Cited in

(10)

• On optimal \((v,5,2,1)\) optical orthogonal codes
• 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 tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
• Further results on balanced \((n, \{3, 4 \}, \Lambda_a, 1)\)-OOCs
• Optimal (v,5,2,1) optical orthogonal codes of small v
• New results on optimal (v,4,2,1) optical orthogonal codes
• A few more optimal optical orthogonal codes with non-constant auto-correlation function
• A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
• Constructions of optimal variable-weight OOCs via quadratic residues
• Further results on optimal \((v,4,2,1)\)-OOCs

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

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