Three classes of partitioned difference families and their optimal constant composition codes
From MaRDI portal
Publication:2158233
DOI10.3934/AMC.2020120zbMATH Open1498.11235OpenAlexW3113391943MaRDI QIDQ2158233FDOQ2158233
Longjiang Qu, Xiwang Cao, Shanding Xu
Publication date: 26 July 2022
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020120
Recommendations
- Constructions of partitioned difference families
- Generic constructions for partitioned difference families with applications: a unified combinatorial approach
- Partitioned difference families and almost difference sets
- Internal and external partial difference families and cyclotomy
- Complete sets of disjoint difference families and their applications
generalized cyclotomyconstant composition codepartitioned difference familyzero-difference balanced function\(d\)-form functiondifference balanced
Cites Work
- Optimal and perfect difference systems of sets
- Zero-difference balanced functions with applications
- Sets of zero-difference balanced functions and their applications
- Optimal Constant Composition Codes From Zero-Difference Balanced Functions
- Some New Classes of Zero-Difference Balanced Functions
- New generalized cyclotomy and its applications
- Cyclic codes from cyclotomic sequences of order four
- Title not available (Why is that?)
- Cyclotomy and difference families in elementary Abelian groups
- On constant-composition codes over Z/sub q/
- New nonbinary sequences with ideal two-level autocorrelation
- A family of difference sets
- Constructions of external difference families and disjoint difference families
- Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties
- Title not available (Why is that?)
- Optimal Frequency Hopping Sequences: A Combinatorial Approach
- Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
- Character Sum Factorizations Yield Sequences With Ideal Two-Level Autocorrelation
- Combinatorial Constructions of Optimal Constant-Composition Codes
- Some New Difference Sets
- New cyclic difference sets with Singer parameters constructed from \(d\)-homogeneous functions
- From a 1-rotational RBIBD to a partitioned difference family
- Constructions of partitioned difference families
- Gauss periods and codebooks from generalized cyclotomic sets of order four
- Cyclotomic Constructions of Zero-Difference Balanced Functions With Applications
- Generic constructions for partitioned difference families with applications: a unified combinatorial approach
- Partitioned difference families and almost difference sets
- Optimal Frequency Hopping Sequences of Odd Length
- Optimal Frequency-Hopping Sequences Via Cyclotomy
- d-form sequences: families of sequences with low correlation values and large linear spans
- On the Sidel'nikov Sequences as Frequency-Hopping Sequences
- $k$-Fold Cyclotomy and Its Application to Frequency-Hopping Sequences
- On disjoint \((v,k,k-1)\) difference families
- Hadamard partitioned difference families and their descendants
- Zero-Difference Balanced Functions With New Parameters and Their Applications
- A Unified Approach to Whiteman's and Ding-Helleseth's Generalized Cyclotomy Over Residue Class Rings
- A generic method to construct zero-difference balanced functions
- A new construction of zero-difference balanced functions and two applications
- The Proof of Lin’s Conjecture via the Decimation-Hadamard Transform
- Partitioned difference families versus zero-difference balanced functions
Cited In (3)
This page was built for publication: Three classes of partitioned difference families and their optimal constant composition codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158233)
