A characterization of {2vα+1 + 2vβ+1, 2vα + 2vβ; t, q}- minihypers in PG(t, q) (t ⩾ 2, q ⩾ 5 and 0 ⩽ α < β < t) and its applications to error-correcting codes
- 20 November 1991
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 93 (1) , 19-33
- https://doi.org/10.1016/0012-365x(91)90214-m
Abstract
No abstract availableKeywords
This publication has 12 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
- A characterization of {νμ + 1 + ε, νμ; t, q}-min.hypers and its applications to error-correcting codes and factorial designsJournal of Statistical Planning and Inference, 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
- A characterization of codes meeting the Griesmer boundInformation and Control, 1981
- 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
- Algebraically punctured cyclic codesInformation and Control, 1965
- A Bound for Error-Correcting CodesIBM Journal of Research and Development, 1960