Almost designs and their links with balanced incomplete block designs
From MaRDI portal
Publication:2324778
DOI10.1007/s10623-018-00596-4zbMath1421.05021arXiv1807.10008OpenAlexW2964078525MaRDI QIDQ2324778
Publication date: 12 September 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.10008
strongly regular graphdifference settournamentconference matrixdoubly regular tournament\(t\)-adesignalmost difference setPaley type strongly regular graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalization of combinatorial designs and related codes
- Generalising Fisher's inequality to coverings and packings
- The existence of almost difference families
- Constructions of almost difference families
- \(t{1\over 2}\)-designs
- Skew-symmetric association schemes with two classes and strongly regular graphs of type \(L_{2n-1}(4n-1)\)
- Almost difference sets and reversible divisible difference sets
- On coverings
- Doubly regular tournaments are equivalent to skew Hadamard matrices
- Cyclotomy and difference families in elementary Abelian groups
- New partial geometric difference sets and partial geometric difference families
- Skew Hadamard Difference Sets from Dickson Polynomials of Order 7
- A new family of almost difference sets and some necessary conditions
- Fundamentals of Error-Correcting Codes
- Combinatorial Designs
- The differential cryptanalysis and design of natural stream ciphers
- New families of binary sequences with optimal three-level autocorrelation
- Orthogonal Matrices with Zero Diagonal
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
This page was built for publication: Almost designs and their links with balanced incomplete block designs
