Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)
Latest Publications

TOTAL DOCUMENTS

336

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

0780371232

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Weight hierarchies of extremal non-chain ternary codes of dimension 4

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) ◽

10.1109/isit.2001.935972 ◽

2002 ◽

Author(s):

Wende Chen ◽

T. Klove

Keyword(s):

Ternary Codes ◽

Weight Hierarchies

Download Full-text

Exact prediction and universal coding for trees

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) ◽

10.1109/isit.2001.935942 ◽

2002 ◽

Cited By ~ 1

Author(s):

F. Topsoe

Keyword(s):

Universal Coding

Download Full-text

Minimum complexity sequential multihypothesis detection

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) ◽

10.1109/isit.2001.935881 ◽

2002 ◽

Author(s):

C. Kose ◽

D.L. Goeckel ◽

Shuangqing Wei

Download Full-text

The capacity of some hexagonal (d,k)-constraints

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) ◽

10.1109/isit.2001.935927 ◽

2002 ◽

Cited By ~ 2

Author(s):

Z. Kukorelly ◽

K. Zeger

Download Full-text

A class of m-ary asymmetric symbol error correcting codes constructed by graph coloring

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) ◽

10.1109/isit.2001.936088 ◽

2002 ◽

Author(s):

H. Kaneko ◽

E. Fujiwara

Keyword(s):

Graph Coloring ◽

Error Correcting Codes

Download Full-text

A class of linear-complexity, soft-decodable, high-rate, "good" codes: construction, properties and performance

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) ◽

10.1109/isit.2001.935985 ◽

2002 ◽

Cited By ~ 1

Author(s):

Jing Li ◽

K.R. Narayanan ◽

C.N. Georghiades

Keyword(s):

Linear Complexity ◽

High Rate ◽

And Performance

Download Full-text

Diversity combining techniques for bandwidth-efficient turbo ARQ systems

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) ◽

10.1109/isit.2001.936076 ◽

2002 ◽

Cited By ~ 1

Author(s):

A. Banerjee ◽

D.J. Costello ◽

T.E. Fuja

Keyword(s):

Diversity Combining

Download Full-text

Near optimum universal belief propagation based decoding of LDPC codes and extension to turbo decoding

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) ◽

10.1109/isit.2001.936052 ◽

2002 ◽

Cited By ~ 2

Author(s):

J. Chen ◽

M.P.C. Fossorier

Keyword(s):

Belief Propagation ◽

Ldpc Codes ◽

Turbo Decoding

Download Full-text

Convex-programming bounds on the capacity of flat-fading channels

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) ◽

10.1109/isit.2001.935915 ◽

2002 ◽

Cited By ~ 5

Author(s):

A. Lapidoth ◽

S.M. Moser

Keyword(s):

Convex Programming ◽

Fading Channels ◽

Flat Fading

Download Full-text

On the statistics of imbalance

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) ◽

10.1109/isit.2001.936025 ◽

2002 ◽

Author(s):

J.L. Massey

Download Full-text

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Weight hierarchies of extremal non-chain ternary codes of dimension 4

Exact prediction and universal coding for trees

Minimum complexity sequential multihypothesis detection

The capacity of some hexagonal (d,k)-constraints

A class of m-ary asymmetric symbol error correcting codes constructed by graph coloring

A class of linear-complexity, soft-decodable, high-rate, "good" codes: construction, properties and performance

Diversity combining techniques for bandwidth-efficient turbo ARQ systems

Near optimum universal belief propagation based decoding of LDPC codes and extension to turbo decoding

Convex-programming bounds on the capacity of flat-fading channels

On the statistics of imbalance

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)
Latest Publications