Set-Codes with Small Intersections and Small Discrepancies
From MaRDI portal
Publication:5112823
DOI10.1137/19M1241106zbMath1441.05029arXiv1901.05559OpenAlexW3027727420MaRDI QIDQ5112823
Ryan Gabrys, Olgica Milenković, Charles J. Colbourn, H. S. Dau
Publication date: 9 June 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.05559
Applications of graph theory (05C90) Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items
Cites Work
- Unnamed Item
- Transversal designs and induced decompositions of graphs
- Low discrepancy sets yield approximate min-wise independent permutation families
- On large sets of disjoint Steiner triple systems. I
- Discrepancy of set-systems and matrices
- A general construction for group-divisible designs
- Balanced two-colorings of finite sets in the square. I
- Bicoloring Steiner triple systems
- Orthogonal arrays. Theory and applications
- Discrepancy and approximations for bounded VC-dimension
- Intersections among Steiner systems
- On the maximum number of disjoint triple systems
- Strict colorings of Steiner triple and quadruple systems: A survey
- Codes for DNA Sequence Profiles
- Some Remarks on the Triple Systems of Steiner.
- Incidences and the spectra of graphs
- Combinatorial Designs
- Multicolour Discrepancies
- Mutually Uncorrelated Primers for DNA-Based Data Storage
- Set-Codes with Small Intersections and Small Discrepancies
- Asymmetric Lee Distance Codes for DNA-Based Storage
- Optimal private halfspace counting via discrepancy
- Extractors and pseudorandom generators
- Orthogonal Arrays of Strength two and three
- The Asymptotic Number of Latin Rectangles
