The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

IEEE Transactions on Information Theory
1983, volume: 29, number: 3

  1. Neil J. A. Sloane
    Papers in honor of F. Jessie MacWilliams. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:329- [Journal]
  2. Cornelius Roos
    A new lower bound for the minimum distance of a cyclic code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:330-331 [Journal]
  3. A. Robert Calderbank
    A square root bound on the minimum weight in quasi-cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:332-336 [Journal]
  4. Harold N. Ward
    Divisors of codeword weights. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:337-341 [Journal]
  5. R. D. Baker, Jacobus H. van Lint, Richard M. Wilson
    On the Preparata and Goethals codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:342-344 [Journal]
  6. William M. Kantor
    On the inequivalence of generalized Preparata codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:345-348 [Journal]
  7. M. R. Best
    Perfect codes hardly exist. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:349-351 [Journal]
  8. Gérard D. Cohen
    A nonconstructive upper bound on covering radius. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:352-353 [Journal]
  9. Nick J. Patterson, Douglas H. Wiedemann
    The covering radius of the (215, 16) Reed-Muller code is at least 16276. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:354-355 [Journal]
  10. H. F. Mattson Jr.
    Another upper bound on covering radius. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:356-358 [Journal]
  11. E. F. Assmus Jr., Vera Pless
    On the coveting radius of extremal self-dual codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:359-363 [Journal]
  12. Neil J. A. Sloane, John G. Thompson
    Cyclic self-dual codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:364-366 [Journal]
  13. E. F. Assmus Jr.
    The binary code arising from a 2-design with a nice collection of ovals. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:367-369 [Journal]
  14. Andries E. Brouwer
    On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:370-371 [Journal]
  15. Elwyn R. Berlekamp
    The construction of fast, high-rate, soft decision block decoders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:372-377 [Journal]
  16. Paul Camion
    Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:378-385 [Journal]
  17. Henk C. A. van Tilborg
    Upper bounds on |C2| for a uniquely decodable code pair (C1, C2) for a two-access binary adder channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:386-389 [Journal]
  18. Thomas H. E. Ericson, János Körner
    Successive encoding of correlated sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:390-395 [Journal]
  19. Rudolf Ahlswede, Te Sun Han
    On source coding with side information via a multiple-access channel and related problems in multi-user information theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:396-411 [Journal]
  20. Boaz Porat, Benjamin Friedlander
    Estimation of spatial and spectral parameters of multiple sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:412-425 [Journal]
  21. A. F. Gualtierotti
    On the stability of signal detection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:426-433 [Journal]
  22. Tor Helleseth
    New constructions of codes meeting the Griesmer bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:434-438 [Journal]
  23. Max H. M. Costa
    Writing on dirty paper. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:439-0 [Journal]
  24. Frans M. J. Willems
    The discrete memoryless multiple access channel with partially cooperating encoders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:441-0 [Journal]
  25. J. Pieter M. Schalkwijk
    On an extension of an achievable rate region for the binary multiplying channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:445-0 [Journal]
  26. Gadiel Seroussi, Abraham Lempel
    Maximum likelihood decoding of certain Reed - Muller codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:448-0 [Journal]
  27. Torleiv Kløve
    On Robinson's coding problem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:450-0 [Journal]
  28. Luigi M. Ricciardi, Shunsuke Sato
    A note on first passage time problems for Gaussian processes and varying boundaries. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:454-0 [Journal]
  29. J. Glaz
    Moving window detection for discrete data. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:457-0 [Journal]
  30. Ning Hsing Lu, Bruce A. Eisenstein
    Suboptimum detection of weak signals in non-Gaussian noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:462-0 [Journal]
  31. S. P. Bruzzone, Mostafa Kaveh
    A criterion for selecting information- preserving data reductions for use in the design of multiple-parameter estimators. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:466-0 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002