On the problem of finding zero-concurring codewords
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (1) , 180-187
- https://doi.org/10.1109/18.61136
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Bounds on the dimension of codes and subcodes with prescribed contraction indexLinear Algebra and its Applications, 1990
- Maximum likelihood soft decoding of binary block codes and decoders for the Golay codesIEEE Transactions on Information Theory, 1989
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- DC-free coset codesIEEE Transactions on Information Theory, 1988
- VLSI implementation of a maximum-likelihood decoder for the Golay (24, 12) codeIEEE Journal on Selected Areas in Communications, 1988
- Soft decoding techniques for codes and lattices, including the Golay code and the Leech latticeIEEE Transactions on Information Theory, 1986
- 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
- On the decomposition of cyclic codes into cyclic classesInformation and Control, 1971
- Coding theory and the Mathieu groupsInformation and Control, 1971