Two classes of convolutional codes over GF(q) for q-ary orthogonal signaling

This publication has 10 references indexed in Scilit:

• Some convolutional codes whose free distances are maximal
  IEEE Transactions on Information Theory, 1989
• Convolutional Codes over GF(q) with Applications to Frequency-Hopping Channels
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• Capacity and Cutoff Rate of Noncoherent FSK with Nonselective Rician Fading
  IEEE Transactions on Communications, 1985
• On a class of convolutional codes
  IEEE Transactions on Information Theory, 1983
• Spread spectrum communications--Myths and realities
  IEEE Communications Magazine, 1979
• An algebraic construction of rate1/v-ary codes; algebraic construction (Corresp.)
  IEEE Transactions on Information Theory, 1975
• Polynomial weights and code constructions
  IEEE Transactions on Information Theory, 1973
• Inverses of Linear Sequential Circuits
  IEEE Transactions on Computers, 1968
• Orthogonal Tree Codes for Communication in the Presence of White Gaussian Noise
  IEEE Transactions on Communication Technology, 1967
• Binary codes with specified minimum distance
  IEEE Transactions on Information Theory, 1960