Journals in DBLP

IEEE Transactions on Information Theory
1984, volume: 30, number: 5

1. Adi Shamir
   A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:699-704 [Journal]
   
2. Tuvi Etzion, Abraham Lempel
   Construction of de Bruijn sequences of minimal complexity. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:705-708 [Journal]
   
3. Jeffrey S. Leon, John Myron Masley, Vera Pless
   Duadic Codes. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:709-713 [Journal]
   
4. N. N. Tendolkar, Carlos R. P. Hartmann
   Generalization of chase algorithms for soft decision decoding of binary linear codes. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:714-721 [Journal]
   
5. Morton Kanefsky, Chung-Bin Fong
   Predictive source coding techniques using maximum likelihood prediction for compression of digitized images. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:722-727 [Journal]
   
6. Georg Lindgren
   Shape and duration of clicks in modulated FM transmission. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:728-735 [Journal]
   
7. Rangasami L. Kashyap
   Characterization and estimation of two-dimensional ARMA models. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:736-744 [Journal]
   
8. Nader Mehravari, T. Berger
   Poisson multiple-access contention with binary feedback. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:745-751 [Journal]
   
9. P. Sen
   On noiseless source coding with specified encoder output symbol frequencies. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:752-0 [Journal]
   
10. K. Deimer
    Some new bounds for the maximum length of circuit codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:754-0 [Journal]
    
11. Ashok K. Gupta
    A note on the variance of polarity-coincidence correlation with an arbitrary covariance matrix. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:756-0 [Journal]
    
12. David M. Mandelbaum
    An approach to an arithmetic analog of Berlekamp's algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:758-0 [Journal]
    
13. Mats L. Cedervall, Rolf Johannesson, Kamil Sh. Zigangirov
    A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:762-0 [Journal]
    
14. G. Tenengolts
    Nonbinary codes, correcting single deletion or insertion. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:766-0 [Journal]
    
15. Kevin T. Phelps
    A product construction for perfect codes over arbitrary alphabets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:769-0 [Journal]
    
16. Torleiv Kløve
    Generalizations of the Korzhik bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:771-0 [Journal]
    
17. Mansour Loeloeian, Jean Conan
    A [55, 16, 19] binary Goppa code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:773-0 [Journal]
    
18. S. L. Ma
    A note on binary arrays with a certain window property. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:774-0 [Journal]
    
19. Justin M. Reyneri, Ehud D. Karnin
    Coin flipping by telephone. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:775-0 [Journal]
    
20. Thomas Siegenthaler
    Correlation-immunity of nonlinear combining functions for cryptographic applications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:776-0 [Journal]
    
21. James E. Mazo
    Review of 'Digital Communications' (Proakis, J.G.; 1983). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:780-0 [Journal]
    
22. Shimon Even, Oded Goldreich
    Correction to 'DES-like functions can generate the alternating group' (Nov 83 863-865). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:780-0 [Journal]