Hamming distance preserving mappings and trellis codes with constrained binary symbols
- 1 January 1989
- journal article
- letter
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 35 (5) , 1098-1103
- https://doi.org/10.1109/18.42229
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Combined error correction/Modulation codesIEEE Transactions on Magnetics, 1987
- Binary transmission codes with higher order spectral zeros at zero frequency (Corresp.)IEEE Transactions on Information Theory, 1987
- Binary rate four eighths, runlength constrained, error correcting magnetic recording modulation codeIEEE Transactions on Magnetics, 1986
- Half Weight Block Codes for Optical CommunicationsAT&T Technical Journal, 1986
- State splitting for variable-length graphs (Corresp.)IEEE Transactions on Information Theory, 1986
- The synthesis of magnetic recording trellis codes with good hamming distance propertiesIEEE Transactions on Magnetics, 1985
- Algorithms for sliding block codes - An application of symbolic dynamics to information theoryIEEE Transactions on Information Theory, 1983
- Lower bounds for constant weight codesIEEE Transactions on Information Theory, 1980
- Block codes for a class of constrained noiseless channelsInformation and Control, 1970
- Sequence-state Methods for Run-length-limited CodingIBM Journal of Research and Development, 1970