Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Maryam Sadeghi 0001

dblp:37/2491-1 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0004-3497-7204ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › space-time codes
full-diversity code
0.912025
Full-Diversity Construction-D Lattices: Design and Decoding Perspective on Block-Fading Channels · IEEE Trans. Commun. 2025
Coding theory
lattice codes
0.912025
Full-Diversity Construction-D Lattices: Design and Decoding Perspective on Block-Fading Channels · IEEE Trans. Commun. 2025
Coding theory › error-correcting codes
space-time codes
0.912025
Full-Diversity Construction-D Lattices: Design and Decoding Perspective on Block-Fading Channels · IEEE Trans. Commun. 2025
Physical-layer communications › fading channels
block-fading channel
0.312025
Full-Diversity Construction-D Lattices: Design and Decoding Perspective on Block-Fading Channels · IEEE Trans. Commun. 2025
Physical-layer communications
fading channels
0.312025
Full-Diversity Construction-D Lattices: Design and Decoding Perspective on Block-Fading Channels · IEEE Trans. Commun. 2025

Methods — techniques the papers use, named apart from their topics

successive cancellation decoding · 1.7nested linear codes · 1.7algebraic number theory · 1.7
YearPublicationVenuePosition
2025 Design and Decoding of Full-Diversity Construction-D Lattices on Block-Fading Channels
abstract
This paper introduces a novel framework for constructing algebraic lattices based on Construction-D, leveraging nested linear codes and prime ideals from algebraic number fields. We focus on the application of these lattices in block-fading (BF) channels, which are characterized by piecewise-constant fading across blocks of transmitted symbols. This approach results in a semi-systematic generator matrix, providing a structured foundation for high -dimensional lattice design for BF channels. The proposed Construction-D lattices exhibit the full diversity property, making them highly effective for error performance improvement. To address this, we develop an efficient decoding algorithm designed specifically for full-diversity Construction-D lattices. Simulations indicate that the proposed lattices notably enhance error performance compared to full-diversity Construction-A lattices, especially in high-diversity scenarios. Interestingly, the anticipated performance gain from increasing the number of nested code levels was only observed in the two-level case. We believe that this is due to the amplified impact of error propagation during successive cancellation at higher levels. These findings highlight the promise of Construction-D lattices as an effective and practical coding strategy for enhancing communication reliability in BF channels.
Maryam Sadeghi 0001, Hassan Khodaiemehr, Chen Feng 0001
ISIT1
2025 Full-Diversity Construction-D Lattices: Design and Decoding Perspective on Block-Fading Channels
abstract
This paper presents a novel framework for constructing full-diversity algebraic lattices based on Construction-D, utilizing nested linear codesC1⊂ · · · ⊂Ca⊆ FpNand prime ideals from algebraic number fields of degree n. Focused on block-fading (BF) channels, this approach yields a semi-systematic generator matrix suited for high-dimensional lattice design. The resulting Construction-D lattices achieve full diversity, significantly enhancing error performance. Additionally, we develop a decoding algorithm tailored for these full-diversity lattices, achieving linear complexity relative to the lattice dimension. Simulations indicate that the proposed lattices notably enhance error performance compared to full-diversity Construction-A lattices in diversity-2 cases. Interestingly, unlike AWGN channels, the expected performance enhancement of Construction-D over Construction-A, resulting from an increased number of nested code levels, was observed only in the two-level and diversity-2 cases. This phenomenon is likely due to the compounded error propagation during successive cancellation at higher levels, further amplified by higher diversity orders. The omission of parity-check enforcement at the final code level—aimed at simplifying our decoding—restricts the diversity order from the maximum ofn·dmin(Ca) ton, limiting performance gains. Unraveling the core reasons behind this decoding behavior remains an open challenge. Nevertheless, these findings highlight the promise of full-diversity Construction-D lattices as an effective coding strategy for BF channels.
Maryam Sadeghi 0001, Hassan Khodaiemehr, Chen Feng 0001
IEEE Trans. Commun.1