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

Soon Sheng Ong

dblp:135/5013 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2015
0000-0002-5363-2445ORCID · corroborated

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

Security and privacy · 1 · 1 first-authorTheory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

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 · 67% Information theory · 33%
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
Physical-layer communications › fading channels
block-fading channel
0.212015
Construction A of Lattices Over Number Fields and Block Fading (Wiretap) Coding · IEEE Trans. Inf. Theory 2015
Physical-layer communications
MIMO
0.212015
Construction A of Lattices Over Number Fields and Block Fading (Wiretap) Coding · IEEE Trans. Inf. Theory 2015
Coding theory › lattice codes
construction a
0.212015
Construction A of Lattices Over Number Fields and Block Fading (Wiretap) Coding · IEEE Trans. Inf. Theory 2015
Coding theory
lattice codes
0.212015
Construction A of Lattices Over Number Fields and Block Fading (Wiretap) Coding · IEEE Trans. Inf. Theory 2015
Information theory › information-theoretic security
wiretap channel coding
0.212015
Construction A of Lattices Over Number Fields and Block Fading (Wiretap) Coding · IEEE Trans. Inf. Theory 2015
YearPublicationVenuePosition
2015 Construction A of Lattices Over Number Fields and Block Fading (Wiretap) Coding
abstract
We propose a lattice construction from totally real and complex multiplication fields, which naturally generalizes Construction A of lattices from p-ary codes obtained from the cyclotomic field Q(ζp), p a prime, which in turn contains the so-called Construction A of lattices from binary codes as a particular case. We focus on the maximal totally real subfield Q(ζpr+ ζp-r) of the cyclotomic field Q(ζpr), r ≥ 1. Our construction has applications to coset encoding of algebraic lattice codes for block fading channels, and in particular for block fading wiretap channels.
Wittawat Kositwattanarerk, Soon Sheng Ong, Frédérique E. Oggier
IEEE Trans. Inf. Theory2
2014 Wiretap lattice codes from number fields with no small norm elements
Soon Sheng Ong, Frédérique E. Oggier
Des. Codes Cryptogr.1
2013 Wiretap encoding of lattices from number fields using codes over Fp
abstract
We consider the problem of communication over a block fading wiretap channel. It is known that coding for such a channel can be done using nested lattice codes constructed over totally real number fields. In this paper, we propose a method for encoding an integral lattice over the ring of integers of a totally real number field, and study in particular the case of Q(ζp+ζp-1) using a linear code over Fp. This generalizes the well-known Construction A and provides an efficient coset encoding for algebraic lattices.
Wittawat Kositwattanarerk, Soon Sheng Ong, Frédérique E. Oggier
ISIT2