A characterization of {νμ + 1 + ε, νμ; t, q}-min.hypers and its applications to error-correcting codes and factorial designs
- 31 July 1989
- journal article
- Published by Elsevier in Journal of Statistical Planning and Inference
- Vol. 22 (3) , 323-336
- https://doi.org/10.1016/0378-3758(89)90098-0
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Characterization of {v μ+1 + 2v μ,v μ + 2v μ − 1;t,q}-min · hypers and its applications to error-correcting codesGraphs and Combinatorics, 1989
- Characterization of {(q + 1) + 2, 1;t, q}-min · hypers and {2(q + 1) + 2, 2; 2,q}-min · hypers in a Finite projective geometryGraphs and Combinatorics, 1989
- Characterization of {2(q+1)+2,2;t,q}- min·hypers in PG(t, q) (t⩾3,q⩾5) and its applications to error-correcting codesDiscrete Mathematics, 1988
- Construction of Optimal Linear Codes Using Flats and Spreads in a Finite Projective GeometryEuropean Journal of Combinatorics, 1982
- Construction of Optimal Codes and Optimal Fractional Factorial Designs Using Linear ProgrammingPublished by Elsevier ,1980
- On a geometrical method of construction of maximal t-linearly independent setsJournal of Combinatorial Theory, Series A, 1978
- A note on the Griesmer bound (Corresp.)IEEE Transactions on Information Theory, 1973
- Linear binary anticodesElectronics Letters, 1970
- On a Bound Useful in the Theory of Factorial Designs and Error Correcting CodesThe Annals of Mathematical Statistics, 1964
- A Bound for Error-Correcting CodesIBM Journal of Research and Development, 1960