Bounds on the dimension of codes and subcodes with prescribed contraction index
- 1 December 1990
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 142, 237-261
- https://doi.org/10.1016/0024-3795(90)90269-i
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Maximum likelihood soft decoding of binary block codes and decoders for the Golay codesIEEE Transactions on Information Theory, 1989
- On the MacWilliams identities for linear codesLinear Algebra and its Applications, 1988
- An updated table of minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1987
- The smallest length of binary 7–dimensional linear codes with prescribed minimum distanceDiscrete Mathematics, 1981
- On a necessary condition for L-step orthogonalization of linear codes and its applicationsInformation and Control, 1973
- A geometric approach to a class of cyclic codesJournal of Combinatorial Theory, 1969
- On the uniqueness of the Golay codesJournal of Combinatorial Theory, 1968
- Algebraically punctured cyclic codesInformation and Control, 1965
- A Bound for Error-Correcting CodesIBM Journal of Research and Development, 1960