Counting the decimation classes of binary vectors with relatively prime length and density
From MaRDI portal
Publication:2114775
Integer programming (90C10) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) General theory for finite permutation groups (20B05) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)
Recommendations
Cites work
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices
- Charm bracelets and their application to the construction of periodic Golay pairs
- Elementary Divisor Rings and Finitely Presented Modules
- Equivalence classes of periodic sequences
- Hadamard ideals and Hadamard matrices with two circulant cores
- On Collineations of Symmetric Designs
- On Multipliers of Difference Sets
- On variations of the subset sum problem
- The Rank of Circulant Matrices
- Translates and Multipliers of Abelian Difference Sets
Cited in
(2)
This page was built for publication: Counting the decimation classes of binary vectors with relatively prime length and density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114775)