Generalizing the Bierbrauer–Friedman bound for orthogonal arrays
Abstract
Translate Article 
Take Notes
Generalizing the Bierbrauer–Friedman bound for orthogonal arrays
ReferencesShowing 10 of 14 papersOrthogonal Arrays Constructions for new orthogonal arrays based on large sets of orthogonal arrays Completely regular codes in graphs covered by a Hamming graph Perfect 2‐colorings of Hamming graphs Factorial Experiments Derivable from Combinatorial Arrangements of Arrays New results on asymmetric orthogonal arrays with strength t ≥ 3 Multispreads Bounds on orthogonal arrays and resilient functions Construction of Asymmetric Orthogonal Arrays With High Strength Perfect 2-colorings of a hypercube
903
- 10.1007/978-1-4612-1478-6
- Jan 1, 1999
15
- 10.1007/s10623-023-01217-5
- Apr 20, 2023
- Designs, Codes and Cryptography
- 10.48550/arxiv.2411.09698
- Nov 14, 2024
10
- 10.1002/jcd.21771
- Mar 10, 2021
- Journal of Combinatorial Designs
433
- 10.2307/2983576
- Jan 1, 1947
- Journal of the Royal Statistical Society Series B: Statistical Methodology
4
- 10.1016/j.disc.2024.114264
- Sep 16, 2024
- Discrete Mathematics
- New
- 10.1016/j.ffa.2025.102675
- Dec 1, 2025
- Finite Fields and Their Applications
31
- 10.1002/jcd.3180030304
- Jan 1, 1995
- Journal of Combinatorial Designs
1
- 10.1002/sta4.70011
- Oct 24, 2024
- Stat
45
- 10.1007/s11202-007-0075-4
- Jul 1, 2007
- Siberian Mathematical Journal
More from: Designs, Codes and CryptographyCorrection: Linearity of $$\mathbb {Z}_{2^L}$$-linear codes via Schur product Ryser’s theorem for simple multi-Latin rectangles Correction: On flag-transitive symmetric (v, k, 4) designs New constructions of cyclic constant-dimension subspace codes based on Sidon spaces and subspace polynomials Linearity of $$\mathbb {Z}_{2^L}$$-linear codes via Schur product More on the sum-freedom of the multiplicative inverse function Generalizing the Bierbrauer–Friedman bound for orthogonal arrays Determining the weight spectrum of the Reed–Muller codes $$RM(m-6,m)$$ Exploiting output bits and the $$\chi $$ operation in MitM preimage attacks on Keccak Galois LCD subspace codes
- Research Article
- 10.1007/s10623-025-01734-5
- Oct 4, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01728-3
- Oct 2, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01730-9
- Sep 28, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01668-y
- Sep 19, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01713-w
- Aug 31, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01712-x
- Aug 14, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01711-y
- Aug 13, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01708-7
- Aug 8, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01703-y
- Aug 7, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01707-8
- Aug 7, 2025
- Designs, Codes and Cryptography
- Ask R Discovery
- Chat PDF
AI summaries and top papers from 250M+ research sources.