Journals in DBLP

IEEE Transactions on Information Theory
2004, volume: 50, number: 2

1. Mung Chiang, Stephen P. Boyd
   Geometric programming duals of channel capacity and rate distortion. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:245-258 [Journal]
   
2. M. Kuijper, J. W. Polderman
   Reed-Solomon list decoding from a system-theoretic perspective. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:259-271 [Journal]
   
3. Pierre Moulin, Mehmet Kivanç Mihçak
   The parallel-Gaussian watermarking game. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:272-289 [Journal]
   
4. Asaf Cohen, Neri Merhav
   Lower bounds on the error probability of block codes based on improvements on de Caen's inequality. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:290-310 [Journal]
   
5. Radinka Dontcheva, A. J. van Zanten, Stefan M. Dodunekov
   Binary self-dual codes with automorphisms of composite order. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:311-318 [Journal]
   
6. Aram Wettroth Harrow, Hoi-Kwong Lo
   A tight lower bound on the classical communication cost of entanglement dilution. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:319-327 [Journal]
   
7. Jean-Pierre Tillich, Gilles Zémor
   The Gaussian isoperimetric inequality and decoding error probabilities for the Gaussian channel. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:328-331 [Journal]
   
8. Tadashi Wadayama
   An algorithm for calculating the exact bit error probability of a binary linear code over the binary symmetric channel. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:331-337 [Journal]
   
9. M. Albanese, Arnaldo Spalvieri
   Computing upper bounds to error probability of soft-decision decoding of Reed-Solomon codes based on the ordered statistics algorithm. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:337-344 [Journal]
   
10. A. Kunisa
    Symbol error probability for guided scrambling over a recording channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:344-349 [Journal]
    
11. Jørn Justesen
    Upper bounds on the number of errors corrected by a convolutional code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:350-353 [Journal]
    
12. Wende Chen, Torleiv Kløve
    On the second greedy weight for linear codes of dimension at least 4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:354-356 [Journal]
    
13. Koichi Betsumiya, Masaaki Harada
    Optimal self-dual codes over F₂*F₂ with respect to the Hamming weight. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:356-358 [Journal]
    
14. T. Aaron Gulliver, Jon-Lark Kim
    Circulant based extremal additive self-dual codes over GF(4). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:359-366 [Journal]
    
15. T. Kiran, B. Sundar Rajan
    Consta-Abelian codes over Galois rings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:367-380 [Journal]
    
16. Ralph Jordan, Rolf Johannesson, Martin Bossert
    On nested convolutional codes and their application to woven codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:380-384 [Journal]
    
17. Yan Xin, Ivan J. Fair
    A performance metric for codes with a high-order spectral at zero frequency. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:385-394 [Journal]
    
18. Gilles Van Assche, Jean Cardinal, Nicolas J. Cerf
    Reconciliation of a quantum-distributed Gaussian key. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:394-400 [Journal]
    
19. V. B. Tadic
    On the almost sure rate of convergence of linear stochastic approximation algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:401-409 [Journal]