On the construction of [q 4 + q 2 ? q, 5,q 4 ? q 3 + q 2 ? 2q; q]-codes meeting the Griesmer bound
- 1 September 1992
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 2 (3) , 225-229
- https://doi.org/10.1007/bf00141966
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Optimal ternary linear codesDesigns, Codes and Cryptography, 1992
- 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 codesDiscrete Mathematics, 1991
- A Characterization of Some Minihypers in a Finite Projective Geometry PG(t, 4)European Journal of Combinatorics, 1990
- Caps and codesDiscrete Mathematics, 1978
- 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