共查询到20条相似文献,搜索用时 46 毫秒
1.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1984,30(2):395-403
For any(n, k, d) binary linear code, the Griesmer bound says thatn geq sum_{i=0}^{k-1} lceil d/2^{i} rceil , wherelceil x rceil denotes the smallest integergeq x . We consider codes meeting the Griesmer bound with equality. These codes have parametersleft( s(2^{k} - 1) - sum_{i=1}^{p} (2^{u_{i}} - 1), k, s2^{k-1} - sum_{i=1}^{p} 2^{u_{i} -1} right) , wherek > u_{1} > cdots > u_{p} geq 1 . We characterize all such codes whenp = 2 oru_{i-1}-u_{i} geq 2 for2 leq i leq p . 相似文献
2.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1981,27(5):548-555
An infinite sequence ofk -dimensional binary linear block codes is constructed with parametersn=2^{k}+2^{k-2}-15,d=2^{k-1}+2^{k-3}-8,k geq 7 . Fork geq 8 these codes are unique, while there are five nonisomorphic codes fork=7 . By shortening these codes in an appropriate way, one finds codes meeting the Griesmer bound for2^{k-1}+2^{k-3}-15 leq d leq 2^{k-1}+2^{k-3}-8; k geq 7 . 相似文献
3.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1975,21(4):460-462
Skew-symmetric sequences of(2n + 1) terms,a_0,a_1,cdots,a_{2n} , are described for which the "merit factor" begin{equation} F_h = frac{biggl[sum_{i=0}^{2n} mid a_i mid biggr] ^2}{ 2 sum_{k=1}^{2n} biggl[ sum_{i=0}^{2n-k} text{sign} (a_i) cdot a_{i+k} biggl] ^2} end{equation} is unusually high. 相似文献
4.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1976,22(3):363-366
This article presents new tighter upper bounds on the rate of Gaussian autoregressive channels with linear feedback. The separation between the upper and lower bounds is small. We havefrac{1}{2} ln left( 1 + rho left( 1+ sum_{k=1}^{m} alpha_{k} x^{- k} right)^{2} right) leq C_{L} leq frac{1}{2} ln left( 1+ rho left( 1+ sum_{k = 1}^{m} alpha_{k} / sqrt{1 + rho} right)^{2} right), mbox{all rho} , whererho = P/N_{0}W, alpha_{l}, cdots, alpha_{m} are regression coefficients,P is power,W is bandwidth,N_{0} is the one-sided innovation spectrum, andx is a root of the polynomial(X^{2} - 1)x^{2m} - rho left( x^{m} + sum^{m}_{k=1} alpha_{k} x^{m - k} right)^{2} = 0. It is conjectured that the lower bound is the feedback capacity. 相似文献
5.
Higher dimensional orthogonal designs and applications 总被引:2,自引:0,他引:2
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1981,27(6):772-779
The concept of orthogonal design is extended to higher dimensions. A properg -dimensional design[d_{ijk cdots upsilon}] is defined as one in which all parallel(g-1) -dimensional layers, in any orientation parallel to a hyper plane, are uncorrelated. This is equivalent to the requirement thatd_{ijk cdots upsilon} in {0, pm x_{1}, cdots , pm x_{t} } , wherex_{1}, cdots , x_{t} are commuting variables, and thatsum_{p} sum_{q} sum_{r} cdots sum_{y} d_{pqr cdots ya} d_{pqr cdots yb} = left( sum_{t} s_{i}x_{i}^{2} right)^{g-1} delta ab, where(s{1}, cdots , s{t}) are integers giving the occurrences ofpm x_{1}, cdots , pm x_{t} in each row and column (this is called the type(s_{1}, cdot ,s_{t})^{g-1}) and(pqr cdots yz) represents all permutations of(ijk cdots upsilon) . This extends an idea of Paul J. Shlichta, whose higher dimensional Hadamard matrices are special cases withx_{1}, cdots , x_{t} in {1,- 1}, (s_{1}, cdots, s_{t})=(g) , and(sum_{t}s_{i}x_{i}^{2})=g . Another special case is higher dimensional weighing matrices of type(k)^{g} , which havex_{1}, cdots , x_{t} in {0,1,- 1}, (s_{1}, cdots, s_{t})=(k) , and(sum_{t}s_{i}x_{i}^{2})=k . Shlichta found properg -dimensional Hadamard matrices of size(2^{t})^{g} . Proper orthogonal designs of type 相似文献
6.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1986,32(1):103-106
Various linear and nonlinearR(r,m) codes having parameters(2^{m}, 2^{k}, 2^{m-r}) withk=sum_{i=0}^{r}left(^{m}_{i}right) are constructed fromR(r,q) andR(r,p) codes,m=p+q . A dual construction forR(m-r,m) codes fromR(p-r,p) andR(q-r,q) codes is also presented,m=p+q . As a simple corollary we have that the number of nonequivalentR(r,m) codes is at least exponential in the length (forr>1) . ForR(m-r,m) codes, the lower bound is doubly exponential in the length (forr>1) . 相似文献
7.
An algorithm for maximizing expected log investment return 总被引:3,自引:0,他引:3
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1984,30(2):369-373
Let the random (stock market) vectorX geq 0 be drawn according to a known distribution functionF(x), x in R^{m} . A log-optimal portfoliob^{ast} is any portfoliob achieving maximal expectedlog returnW^{ast}=sup_{b} E ln b^{t}X , where the supremum is over the simplexb geq 0, sum_{i=1}^{m} b_{i} = 1 . An algorithm is presented for findingb^{ast} . The algorithm consists of replacing the portfoliob by the expected portfoliob^{'}, b_{i}^{'} = E(b_{i}X_{i}/b^{t}X) , corresponding to the expected proportion of holdings in each stock after one market period. The improvement inW(b) after each iteration is lower-bounded by the Kullback-Leibler information numberD(b^{'}|b) between the current and updated portfolios. Thus the algorithm monotonically improves the returnW . An upper bound onW^{ast} is given in terms of the current portfolio and the gradient, and the convergence of the algorithm is established. 相似文献
8.
Bent-function sequences 总被引:12,自引:0,他引:12
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1982,28(6):858-864
In this paper we construct a new family of nonlinear binary signal sets which achieve Welch's lower bound on simultaneous cross correlation and autocorrelation magnitudes. Given a parametern withn=0 pmod{4} , the period of the sequences is2^{n}-1 , the number of sequences in the set is2^{n/2} , and the cross/auto correlation function has three values with magnitudesleq 2^{n/2}+1 . The equivalent linear span of the codes is bound above bysum_{i=1}^{n/4}left(stackrel{n}{i} right) . These new signal sets have the same size and correlation properties as the small set of Kasami codes, but they have important advantages for use in spread spectrum multiple access communications systems. First, the sequences are "balances," which represents only a slight advantage. Second, the sequence generators are easy to randomly initialize into any assigned code and hence can be rapidly "hopped" from sequence to sequence for code division multiple access operation. Most importantly, the codes are nonlinear in that the order of the linear difference equation satisfied by the sequence can be orders of magnitude larger than the number of memory elements in the generator that produced it. This high equivalent linear span assures that the code sequence cannot be readily analyzed by a sophisticated enemy and then used to neutralize the advantages of the spread spectrum processing. 相似文献
9.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1978,24(5):627-628
Upper bounds on the covering radius of binary codes are studied. In particular it is shown that the covering radiusr_{m} of the first-order Reed-Muller code of lenglh2^{m} satisfies2^{m-l}-2^{lceil m/2 rceil -1} r_{m} leq 2^{m-1}-2^{m/2-1} . 相似文献
10.
Duadic Codes 总被引:3,自引:0,他引:3
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1984,30(5):709-714
A new family of binary cyclic(n,(n + 1)/2) and(n,(n - 1)/2) codes are introduced, which include quadratic residue (QR) codes whenn is prime. These codes are defined in terms of their idempotent generators, and they exist for all oddn = p_{1}^{a_{1}} p_{2}^{a_{2}} cdots p_{r}^{a_{r}} where eachp_{i} is a primeequiv pm 1 pmod{8} . Dual codes are identified. The minimum odd weight of a duadic(n,(n + 1)/2) code satisfies a square root bound. When equality holds in the sharper form of this bound, vectors of minimum weight hold a projective plane. The unique projective plane of order 8 is held by the minimum weight vectors in two inequivalent(73,37,9) duadic codes. All duadic codes of length less than127 are identified, and the minimum weights of their extensions are given. One of the duadic codes of length113 has greater minimum weight than the QR code of that length. 相似文献
11.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1967,13(1):91-94
The probability of a set of binaryn -tuples is defined to be the sum of the probabilities of the individualn -tuples when each digit is chosen independently with the same probabilityp of being a "one." It is shown that, under such a definition, the ratio between the probability of a subgroup of order2^{k} and any of its proper cosets is always greater than or equal to a functionF_{k}(p) , whereF_{k}(p) geq 1 forp leq frac{1}{2} with equality when and only whenp = frac{1}{2} . It is further shown thatF_{k}(p) is the greatest lower bound on this ratio, since a subgroup and proper coset of order2^{k} can always be found such that the ratio between their probabilities is exactlyF_{k}(p) . It is then demonstrated that for a linear code on a binary symmetric channel the "tall-zero" syndrome is more probable than any other syndrome. This result is applied to the problem of error propagation in convolutional codes. 相似文献
12.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1972,18(2):310-312
Given a binary data streamA = {a_i}_{i=o}^infty and a filterF whose output at timen isf_n = sum_{i=0}^{n} a_i beta^{n-i} for some complexbeta neq 0 , there are at most2^{n +1) distinct values off_n . These values are the sums of the subsets of{1,beta,beta^2,cdots,beta^n} . It is shown that all2^{n+1} sums are distinct unlessbeta is a unit in the ring of algebraic integers that satisfies a polynomial equation with coefficients restricted to +1, -1, and 0. Thus the size of the state space{f_n} is2^{n+1} ifbeta is transcendental, ifbeta neq pm 1 is rational, and ifbeta is irrational algebraic but not a unit of the type mentioned. For the exceptional values ofbeta , it appears that the size of the state space{f_n} grows only as a polynomial inn ifmidbetamid = 1 , but as an exponentialalpha^n with1 < alpha < 2 ifmidbetamid neq 1 . 相似文献
13.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1979,25(1):110-112
A recent paper [1] discussed the2^{-p} bound (wherep = n- k ) for the probability of undetected errorP(epsilon) for an(n,k) block code used for error detection on a binary symmetric channel. This investigation is continued and extended and dual codes are studied. The dual and extension of a perfect code obey the2^{-p} bound, but this is not necessarily true for arbitrary codes that obey the bound. Double-error-correcting BCH codes are shown to obey the bound. Finally the problem of constructing uniformly good codes is examined. 相似文献
14.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1970,16(6):745-751
In this paper, we establish the following result. Theorem:A_i , the number of codewords of weighti in the second-order binary Reed-Muller code of length2^m is given byA_i = 0 unlessi = 2^{m-1} or2^{m-1} pm 2^{m-l-j} , for somej, 0 leq j leq [m/2], A_0 = A_{2^m} = 1 , and begin{equation} begin{split} A_{2^{m-1} pm 2^{m-1-j}} = 2^{j(j+1)} &{frac{(2^m - 1) (2^{m-1} - 1 )}{4-1} } \ .&{frac{(2^{m-2} - 1)(2^{m-3} -1)}{4^2 - 1} } cdots \ .&{frac{(2^{m-2j+2} -1)(2^{m-2j+1} -1)}{4^j -1} } , \ & 1 leq j leq [m/2] \ end{split} end{equation} begin{equation} A_{2^{m-1}} = 2 { 2^{m(m+1)/2} - sum_{j=0}^{[m/2]} A_{2^{m-1} - 2^{m-1-j}} }. end{equation} 相似文献
15.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1986,32(4):592-594
For a discreteN -valued random variable (N possibly denumerably infinite) Leung-Yan-Cheong and Cover have given bounds for the minimal expected length of a one-to-one (not necessarily uniquely decodable) codeL_{1:1}=sum_{i=1}^{N} p_{i} log left( frac{1}{2} + 1 right). It is shown that the best possible case occurs for certain denumerably infinite sets of nonzero probabilities. This absolute bound is related to the Shannon entropyH of the distribution by(h (cdot) is the binary entropy function). 相似文献
16.
Achievable rates for multiple descriptions 总被引:12,自引:0,他引:12
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1982,28(6):851-857
17.
Higher-dimensional Hadamard matrices 总被引:1,自引:0,他引:1
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1979,25(5):566-572
The concept of a Hadamard matrix as a binary orthogonal matrix is extended to higher dimensions. Ann -dimensional Hadamard matrix[h_{ijk cdots n}] is defined as one in which all parallel(n - 1) -dimensional layers, in any axis-normal orientation, are uncorrelated. This is equivalent to the requirements thath_{ijk cdots n} = pm1 and thatsum_{p} sum_{q} sum_{r} cdots sum_{y} h_{pqr cdots yb}= m^{(n-1)} delta_{ab} where(pqr cdots yz) represents all permutations of(ijk cdots n) . A "proper"n -dimensional Hadamard matrix is defined as a special case of the above in which all two-dimensional layers, in all axis-normal orientations, are Hadamard matrices, as a consequence of which all intermediate-dimensional layers are also Hadamard matrices. Procedures are described for deriving three- and four-dimensional Hadamard matrices of varying propriety from two-dimensional Hadamard matrices. A formula is given for a fully propern -dimensional matrix of order two, which can be expanded by direct multiplication to yield proper(2^{t})^{n} Hadamard matrices. It is suggested that proper higher dimensional Hadamard matrices may find application in error-correcting cedes, where their hierarchy of orthogonalitias permit a variety of checking procedures. Other types of Hadamard matrices may be of use in security codes on the basis of their resemblance to random binary matrices. 相似文献
18.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1969,15(3):408-413
It is shown that ifm neq 8, 12 andm > 6 , there are some binary primitive BCH codes (BCH codes in a narrow sense) of length2^{m} - 1 whose minimum weight is greater than the BCH bound. This gives a negative answer to the question posed by Peterson [1] of whether or not the BCH bound is always the actual minimum weight of a binary primitive BCH code. It is also shown that for any evenm geq 6 , there are some binary cyclic codes of length2^{m} - 1 that have more information digits than the primitive BCH codes of length2^{m} - 1 with the same minimum weight. 相似文献
19.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1978,24(2):254-256
An upper bound is derived for the mean-square error involved when a non-band-limited, wide-sense stationary random processx(t) (possessing an integrable power spectral density) is approximated by a cardinal series expansion of the formsum^{infty}_{-infty}x(n/2W) sinc2W(t-n/2W) , a sampling expansion based on the choice of some nominal bandwidthW > 0 . It is proved thatlim_{N rightarrow infty} E {|x(t) - x_{N}(t)|^{2}} leq frac{2}{pi}int_{| omega | > 2 pi W}S_{x}( omega) d omega, wherex_{N}(t) = sum_{-N}^{N}x(n/2W) sinc2W(t-n/2W) , andS_{x}(omega) is the power spectral density forx(t) . Further, the constant2/ pi is shown to be the best possible one if a bound of this type (involving the power contained in the frequency region lying outside the arbitrarily chosen band) is to hold uniformly int . Possible reductions of the multiplicative constant as a function oft are also discussed, and a formula is given for the optimal value of this constant. 相似文献
20.
Writing on dirty paper (Corresp.) 总被引:1,自引:0,他引:1
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1983,29(3):439-441
A channel with outputY = X + S + Z is examined, The stateS sim N(0, QI) and the noiseZ sim N(0, NI) are multivariate Gaussian random variables (I is the identity matrix.). The inputX in R^{n} satisfies the power constraint(l/n) sum_{i=1}^{n}X_{i}^{2} leq P . IfS is unknown to both transmitter and receiver then the capacity isfrac{1}{2} ln (1 + P/( N + Q)) nats per channel use. However, if the stateS is known to the encoder, the capacity is shown to beC^{ast} =frac{1}{2} ln (1 + P/N) , independent ofQ . This is also the capacity of a standard Gaussian channel with signal-to-noise power ratioP/N . Therefore, the stateS does not affect the capacity of the channel, even thoughS is unknown to the receiver. It is shown that the optimal transmitter adapts its signal to the stateS rather than attempting to cancel it. 相似文献