On a Bound Useful in the Theory of Factorial Designs and Error Correcting Codes
From MaRDI portal
Publication:5737518
DOI10.1214/aoms/1177703764zbMath0124.11503OpenAlexW2048456356MaRDI QIDQ5737518
R. C. Bose, Jagdish N. Srivastava
Publication date: 1964
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177703764
Related Items
Uniqueness of \([87,5,57; 3\)-codes and the nonexistence of \([258,6,171; 3]\)-codes], A characterization of some \(\{ 3v_ 2+v_ 3,3v_ 1+v_ 2; 3,3\}\)-minihypers and some \([15,4,9; 3\)-codes with \(B_ 2=0\)], A characterization of some \(\{ 3v_ 1+v_ 3,3v_ 0+v_ 2; 3,3\}\)-minihypers and its applications to error-correcting codes, The nonexistence of \([71,5,46;3\)-codes], A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs, J.N. Srivastava and experimental design, A characterization of some \(\{v_ 2+2v_ 3,v_ 1+2v_ 2;k-1,3\}\)-minihypers and some \((v_ k-30,k,3^{k-1}-21;3)\)-codes meeting the Griesmer bound, Caps and codes, A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry], Some economic partially balanced \(2^ m\) factorial fractions, A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min\(\cdot hyper\) in a finite projective geometry, Some general existence conditions for balanced arrays of strength \(t\) and 2 symbols, On the nonexistence of some quaternary linear codes meeting the Griesmer bound, The nonexistence of ternary [79, 6, 51 codes], The packing problem in statistics, coding theory and finite projective spaces
