空时正交编码源程序，参考文献： V.Tarokh,H. Jafarkhani,and A. R. Calderbank \"Space-Time Codes from ％Orthogonal Designs\",IEEE Trans. Inform. Theory VOL. 45,NO. 5,JULY 1-orthogonal space-time coding source, References : V. Tarokh, H. Jafarkhani. and A. R. Calderba

排列问题 M个1,N个0的排列(高效率版) 排列数为:c(m+n,n) 对n个0,m个1,我的想法是这样的: 每个排列可以分三段: 全0列,全1列, 子问题列 设各段长:r,s,t .子问题列就是 (n,m) = (n-r,m-s),其中0<=r<=n,s=1-problem with M-1, N 0 is the order (high-efficiency version) with a few : c (m n, n) of n 0, m one, I