Orthogonal and Quasi-Orthogonal Tree Codes with Applications to Multiple Access
- 1 February 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 27 (2) , 449-460
- https://doi.org/10.1109/tcom.1979.1094384
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Performance Evaluation for Phase-Coded Spread-Spectrum Multiple-Access Communication--Part I: System AnalysisIEEE Transactions on Communications, 1977
- Error Probability of Asynchronous Spread Spectrum Multiple Access Communication SystemsIEEE Transactions on Communications, 1977
- Convolutional Codes and Their Performance in Communication SystemsIEEE Transactions on Communication Technology, 1971
- A New Coding Technique for Asynchronous Multiple Access CommunicationIEEE Transactions on Communication Technology, 1971
- Viterbi Decoding for Satellite and Space CommunicationIEEE Transactions on Communication Technology, 1971
- Computing approximations for the generalized Q function and its complement (Corresp.)IEEE Transactions on Information Theory, 1971
- Optimal binary sequences for spread spectrum multiplexing (Corresp.)IEEE Transactions on Information Theory, 1967
- A recursive method of computing the Q function (Corresp.)IEEE Transactions on Information Theory, 1965
- Table of the zeros and weight factors of the first 20 hermite polynomialsJournal of Research of the National Bureau of Standards, 1952
- Table of the zeros and weight factors of the first fifteen Laguerre polynomialsBulletin of the American Mathematical Society, 1949