Counting the decimation classes of binary vectors with relatively prime length and density
DOI10.1007/S10801-020-00990-ZzbMATH Open1486.90127OpenAlexW3109200346MaRDI QIDQ2114775FDOQ2114775
Jonathan S. Turner, Dursun A. Bulutoglu, Andrew J. Geyer, Daniel Baczkowski
Publication date: 15 March 2022
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-020-00990-z
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)
Cites Work
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- On Collineations of Symmetric Designs
- Elementary Divisor Rings and Finitely Presented Modules
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- The Rank of Circulant Matrices
- On variations of the subset sum problem
- Translates and Multipliers of Abelian Difference Sets
- Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices
- On Multipliers of Difference Sets
- Hadamard ideals and Hadamard matrices with two circulant cores
- Charm bracelets and their application to the construction of periodic Golay pairs
- Equivalence classes of periodic sequences
Cited In (1)
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)