ISSN: 1930-5346

Journal Home

Journal Guideline

Advances in Mathematics of Communications Q2 Unclaimed

American Institute of Mathematical Sciences United States

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

Advances in Mathematics of Communications is a journal indexed in SJR in Applied Mathematics and Computer Networks and Communications with an H index of 27. It has an SJR impact factor of 0,463 and it has a best quartile of Q2. It has an SJR impact factor of 0,463.

Type: Journal

Type of Copyright:

Languages:

Open Access Policy:

Type of publications:

Publication frecuency: -

Categories: Algebra and Number Theory (Q2) Applied Mathematics (Q2) Discrete Mathematics and Combinatorics (Q2) Computer Networks and Communications (Q3)

Price

- €

Inmediate OA

NPD

Embargoed OA

- €

Non OA

Metrics

Advances in Mathematics of Communications

0,463

SJR Impact factor

27

H Index

89

Total Docs (Last Year)

128

Total Docs (3 years)

2539

Total Refs

133

Total Cites (3 years)

126

Citable Docs (3 years)

1.15

Cites/Doc (2 years)

28.53

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

Journal of Computational and Applied Mathematics Q2
European Journal of Applied Mathematics Q2
Numerical Algorithms Q2
SIAM Journal on Financial Mathematics Q2
Digital Signal Processing: A Review Journal Q2

Compare this journals

Aims and Scope

Best articles by citations

A note on the minimum Lee distance of certain self-dual modular codes

On the number of bent functions from iterative constructions: lower bounds and hypotheses

On the dual of (non)-weakly regular bent functions and self-dual bent functions

New nearly optimal codebooks from relative difference sets

Arbitrarily varying multiple access channels with conferencing encoders: List decoding and finite coordination resources

On the degrees of freedom of Costas permutations and other constraints

Subexponential time relations in the class group of large degree number fields

The nonassociative algebras used to build fast-decodable space-time block codes

Bounds on the number of rational points of algebraic hypersurfaces over finite fields, with applications to projective Reed-Muller codes

The one-out-of-k retrieval problem and linear network coding

A note on Erdos-Ko-Rado sets of generators in Hermitian polar spaces

Fast ideal cubing in imaginary quadratic number and function fields

SHOW MORE ARTICLES

An approach to the performance of SPC product codes on the erasure channel

On finite fields for pairing based cryptography

Error bounds for repeat-accumulate codes decoded via linear programming

Space-time block codes from nonassociative division algebras

All binary linear codes of lengths up to 18 or redundancy up to 10 are normal

Results of the enumeration of Costas arrays of order 29

On maximal curves over finite fields of small order

Unified combinatorial constructions of optimal optical orthogonal codes

Nearly perfect sequences with arbitrary out-of-phase autocorrelation

Relations between arithmetic geometry and public key cryptography

Short one-time signatures

Composition codes