On linear codes which attain the Solomon-Stiffler bound
- 30 April 1984
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 49 (2) , 179-191
- https://doi.org/10.1016/0012-365x(84)90116-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- 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
- Algebraically punctured cyclic codesInformation and Control, 1965
- Error-Correcting Codes-A Linear Programming ApproachBell System Technical Journal, 1959