Characterization of {v μ+1 + 2v μ,v μ + 2v μ − 1;t,q}-min · hypers and its applications to error-correcting codes
- 1 December 1989
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 5 (1) , 137-147
- https://doi.org/10.1007/bf01788665
Abstract
No abstract availableKeywords
This publication has 10 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
- 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
- A note on the construction of optimal linear codesJournal of Statistical Planning and Inference, 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
- Algebraically punctured cyclic codesInformation and Control, 1965
- A Bound for Error-Correcting CodesIBM Journal of Research and Development, 1960