Key Metrics
CiteScore 

1.8
H-Index 

25
Impact Factor 

< 5
SJR 

Q2Applied Mathematics

SNIP 

0.99
Recommended pre-submission checks
Powered by 

Topics Covered on Advances in Mathematics of Communications
Advances in Mathematics of Communications Journal Specifications
Indexed in the following public directories
Web of Science
Scopus
SJR
| Overview | |
| Publisher | AMER INST MATHEMATICAL SCIENCES-AIMS |
| Language | English |
| Frequency | Quarterly |
| General Details | |
| Language | English |
| Frequency | Quarterly |
| Publication Start Year | 2007 |
| Publisher URL | Visit website |
| Website URL | Visit website |
View less
Planning to publish in Advances in Mathematics of Communications ?
Upload your Manuscript to get
- Degree of match
- Common matching concepts
- Additional journal recommendations

Recently Published Papers in Advances in Mathematics of Communications
On the computation of <i>q</i>-transform of Boolean functions
- 1 Jan 2025
- Advances in Mathematics of Communications
Linear codes with few weights over <inline-formula><tex-math id="M1">$ \mathbb{F}_{p}+u\mathbb{F}_{p} $</tex-math></inline-formula>
- 1 Jan 2025
- Advances in Mathematics of Communications
Explicit construction of codes correcting a single reverse-complement duplication of arbitrary length
- 1 Jan 2025
- Advances in Mathematics of Communications
Linear Complementary Dual Codes over the <inline-formula><tex-math id="M1">$ p $</tex-math></inline-formula>-adic Integers
- 1 Jan 2025
- Advances in Mathematics of Communications
How to expand a self-orthogonal code
- 1 Jan 2025
- Advances in Mathematics of Communications
Binary cyclic codes from three classes of sequences
- 1 Jan 2025
- Advances in Mathematics of Communications
On the computation of <i>q</i>-transform of Boolean functions
- 1 Jan 2025
- Advances in Mathematics of Communications
Linear codes with few weights over <inline-formula><tex-math id="M1">$ \mathbb{F}_{p}+u\mathbb{F}_{p} $</tex-math></inline-formula>
- 1 Jan 2025
- Advances in Mathematics of Communications
Explicit construction of codes correcting a single reverse-complement duplication of arbitrary length
- 1 Jan 2025
- Advances in Mathematics of Communications
Linear Complementary Dual Codes over the <inline-formula><tex-math id="M1">$ p $</tex-math></inline-formula>-adic Integers
- 1 Jan 2025
- Advances in Mathematics of Communications
How to expand a self-orthogonal code
- 1 Jan 2025
- Advances in Mathematics of Communications
Binary cyclic codes from three classes of sequences
- 1 Jan 2025
- Advances in Mathematics of Communications