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 codes
- 31 December 1988
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 71 (3) , 219-231
- https://doi.org/10.1016/0012-365x(88)90102-1
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On linear codes which attain the Solomon-Stiffler boundDiscrete Mathematics, 1984
- Construction of Optimal Linear Codes Using Flats and Spreads in a Finite Projective GeometryEuropean Journal of Combinatorics, 1982
- A characterization of codes meeting the Griesmer boundInformation and Control, 1981
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer boundInformation and Control, 1980
- 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
- Algebraically punctured cyclic codesInformation and Control, 1965
- A Bound for Error-Correcting CodesIBM Journal of Research and Development, 1960