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

Fan Zhou 0005

dblp:63/3122-5 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2022
0000-0002-1924-0683ORCID · verified

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

Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-authorTheory of computation · 1 · 1 first-authorApplied, 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%

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

TopicWeightPapersLastEvidence papers
Coding theory
lattice codes
0.612022
Construction D' Lattices for Power-Constrained Communications · IEEE Trans. Commun. 2022
Coding theory › error-correcting codes
convolutional codes
0.212022
Construction D' Lattices for Power-Constrained Communications · IEEE Trans. Commun. 2022
Coding theory › error-correcting codes
LDPC codes
0.212022
Construction D' Lattices for Power-Constrained Communications · IEEE Trans. Commun. 2022
Coding theory › error-correcting codes › LDPC codes
quasi-cyclic LDPC codes
0.212022
Construction D' Lattices for Power-Constrained Communications · IEEE Trans. Commun. 2022
Coding theory › error-correcting codes › coded modulation
shaping codes
0.212022
Construction D' Lattices for Power-Constrained Communications · IEEE Trans. Commun. 2022

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

nested lattice coding · 0.6belief propagation decoding · 0.6
YearPublicationVenuePosition
2022 Construction D' Lattices for Power-Constrained Communications
abstract
Designs and methods for nested lattice codes using Construction D’ lattices for coding and convolutional code lattices for shaping are described. Two encoding methods and a decoding algorithm for Construction D’ coding lattices that can be used with shaping lattices for power-constrained channels are given. We construct nested lattice codes with good coding properties, high shaping gain, and low-complexity encoding and decoding. Convolutional code generator polynomials for Construction A lattices with the greatest shaping gain are given, as a result of an extensive search. It is shown that rate 1/3 convolutional codes provide a more favorable performance-complexity trade-off than rate 1/2 convolutional codes. Tail-biting convolutional codes have higher shaping gain than that of zero-tailed convolutional codes. A design for quasi-cyclic low-density parity-check (QC-LDPC) codes to form Construction D’ lattices which have efficient encoding and indexing is presented. The resulting QC-LDPC Construction D’ lattices are evaluated using four shaping lattices: the$E_{8}$lattice, the$BW_{16}$lattice, the Leech lattice and our best-found convolutional code lattice, showing a shaping gain of approximately 0.65 dB, 0.86 dB, 1.03 dB and 1.25 dB at dimension 2304.
Fan Zhou 0005, Brian M. Kurkoski
IEEE Trans. Commun.1
2021 Encoding and Decoding Construction D' Lattices for Power-Constrained Communications
abstract
This paper focuses on the encoding and decoding of Construction D' coding lattices that can be used with shaping lattices for power-constrained channels. Two encoding methods and a decoding algorithm for Construction D' lattices are given. A design of quasi-cyclic low-density parity-check (QC-LDPC) codes to form Construction D' lattices is presented. This allows construction of nested lattice codes which are good for coding, good for shaping, and have low-complexity encoding and decoding. Numerical results using$E_{8},\ BW_{16}$and Leech lattices for shaping a Construction D' lattice indicate that the shaping gains 0.65 dB, 0.86 dB and 1.03 dB are preserved, respectively.
Fan Zhou 0005, Arini Fitri, Khoirul Anwar, Brian M. Kurkoski
ISIT1
2018 Shaping Gain of Lattices Based on Convolutional Codes and Construction A
abstract
This paper studies the shaping gain and the performance-complexity trade-off of convolutional code lattices, lattices that are based on convolutional codes and Construction A. Generator polynomials for convolutional codes which provide the best-found shaping gain are presented, for various code rates, memory orders and lattice dimensions. Results are based on exhaustive searches. The obtained shaping gains usually exceed that of convolutional codes good for coding. Convolutional code lattices with memory order 7 can provide a shaping gain of 1.20 dB (up to a possible 1.53 dB theoretical maximum) at dimension 256, which is higher than the 1.03 dB shaping gain of the Leech lattice. While convolutional code lattices based on rate 1/2 convolutional codes have the best shaping gain for a fixed memory order, we show that using rate 1/3 convolutional codes produces a more favorable performance-complexity trade-off.
Fan Zhou 0005, Brian M. Kurkoski
ISITA1