Promote Sponsor
verified SJR 1,464 · Q1 • database Scopus / SJR & Web of Science indexed
IEEE Transactions on Information Theory
United States · Institute of Electrical and...
workspace_premium Q1 — Information Systems lock Subscription Unclaimed

IEEE Transactions on Information Theory

IEEE Transactions on Information Theory is a journal indexed in SJR in Information Systems and Computer Science Applications with an H index of 304. It has an SJR impact factor of 1,464 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 1,464.

IEEE Transactions on Information Theory focuses its scope in these topics and keywords: codes, gaussian, minimum, detection, estimation, likelihood, arbitrary, compressive, construction, method, ...

ISSN: 0018-9448
Editorial: Institute of Electrical and Electronics Engineers Inc.
Category: Information Systems
Indexation: verifiedScopus / SJR verifiedWeb of Science

Unclaimed profile — some fields may be incomplete.

open_in_new Portal NPD menu_book Guidelines NPD
schedule Datos CoP · solo campos en BD
SJR Impact Factor trending_up
1,464 Q1
H-index 304
Tasa de Aceptación pie_chart
18% Selectiva
Fuente Acceptance_Rate
Tiempo a publicación hourglass_top
NPD
Campo Sin dato
Coste de Publicación (APC) payments
NPD Subscription
Ruta Non-OA NPD

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

1,464

H-index

304

Docs (year)

547

Docs 3y

1400

Total refs

22729

Cites 3y

4708

Citable 3y

1399

Cites/Doc 2y

3.24

Ref/Doc

41.55

Immediate OA

—

Embargoed OA

NPD

Non OA / Submission

—

shield Researcher voice

Name good journals. Call out predatory ones.

Share what peer review, fees, and timelines were really like. Praise fair editors. Flag APC traps, fake metrics, or spam solicitations — with facts from your submission.

Fair & fast peer review Clear APC / no surprise fees Suspected predatory Fake impact claims
rate_review Write an honest review

Researcher reviews

sentiment_dissatisfied No reviews yet — be the first to share an honest experience.
User
* Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Capacity of a mobile multiple-antenna wireless link with isotropically random rician fading

View more

Weighted Nonbinary Repeat-Accumulate Codes

View more

Deviation bounds for wavelet shrinkage

View more

Determining the Number of Samples Required to Estimate Entropy in Natural Sequences

View more

Data verification and reconciliation with generalized error-control codes

View more

Covering codes with improved density

View more

Context-dependent multilevel pattern matching for lossless image compression

View more

Common coordinates in consecutive addresses

View more

Codes on graphs: constraint complexity of cycle-free realizations of linear codes

View more

Codecell convexity in optimal entropy-constrained vector quantization

View more

Capacity-Achieving Probability Measure for Conditionally Gaussian Channels With Bounded Inputs

View more

Capacity of reproducing kernel spaces in learning theory

View more
SHOW MORE ARTICLES

Capacity of mimo systems with semicorrelated flat fading

View more

A first course in information theory [Book Review]

View more

Capacity Bounds for Wireless Optical Intensity Channels With Gaussian Noise

View more

Binary pulse compression codes

View more

Binary intersymbol interference channels: gallager codes, density evolution, and code performance bounds

View more

Balanced information inequalities

View more

Average Coset Weight Distributions of Gallager's LDPC Code Ensemble

View more

Antenna selection for multiple-antenna transmission systems: performance analysis and code construction

View more

An optimum symbol-by-symbol decoding rule for linear codes

View more

Algorithm and architecture for a Galois field multiplicative arithmetic processor

View more

Algebraic properties of space-time block codes in intersymbol interference multiple-access channels

View more

A Note on Density Model Size Testing

View more

FAQS