A new binary code of length 10 and covering radius 1
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (1) , 179-180
- https://doi.org/10.1109/18.61135
Abstract
A mixed code of covering radius 1 that has 60 codewords is constructed. This code is then used to show that K(10,1)⩽120Keywords
This publication has 20 references indexed in Scilit:
- Bounds on the dimension of codes and subcodes with prescribed contraction indexLinear Algebra and its Applications, 1990
- VLSI implementation of a maximum-likelihood decoder for the Golay (24, 12) codeIEEE Journal on Selected Areas in Communications, 1988
- A Recursive Hadamard Transform Optimal Soft Decision Decoding AlgorithmSIAM Journal on Algebraic Discrete Methods, 1987
- Optimal soft decision block decoders based on fast Hadamard transformIEEE Transactions on Information Theory, 1986
- Soft decoding techniques for codes and lattices, including the Golay code and the Leech latticeIEEE Transactions on Information Theory, 1986
- The concatenated structure of cyclic and Abelian codesIEEE Transactions on Information Theory, 1985
- Computing automorphism groups of error-correcting codesIEEE Transactions on Information Theory, 1982
- The weight distributions of some minimal cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1981
- Some long cyclic linear binary codes are not so badIEEE Transactions on Information Theory, 1974
- On the decomposition of cyclic codes into cyclic classesInformation and Control, 1971