Orthogonal Tree Codes for Communication in the Presence of White Gaussian Noise
- 1 April 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communication Technology
- Vol. 15 (2) , 238-242
- https://doi.org/10.1109/tcom.1967.1089561
Abstract
This paper describes a convolutional encoder for generating tree codes whose distinct codewords are orthogonal over the constraint length of the code. The performance of this class of codes is analyzed and the error probability is shown to decrease exponentially with the energy-to-noise ratio over the constraint length period of the code. The performance is compared with wellknown results for orthogonal block codes and shown to be considerably superior to the latter. Asymptotic results are also obtained which coincide with results for the class of very noisy memoryless channels.Keywords
This publication has 4 references indexed in Scilit:
- The Noisy Channel Coding Theorem for Erasure ChannelsThe American Mathematical Monthly, 1974
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967
- Sequential Decoding - The Computation Problem*Bell System Technical Journal, 1966
- On Coded Phase-Coherent CommunicationsIRE Transactions on Space Electronics and Telemetry, 1961