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

Chaichana Mitrpant

dblp:37/4293 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none

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

Theory of computation · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-author

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
2 papers
Information theory · 51% Coding theory · 49%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › information-theoretic security
perfect secrecy
0.112006
An achievable region for the Gaussian wiretap channel with side information · IEEE Trans. Inf. Theory 2006
Information theory › information-theoretic security
secrecy capacity
0.112006
An achievable region for the Gaussian wiretap channel with side information · IEEE Trans. Inf. Theory 2006
Information theory › information-theoretic security
wiretap channel
0.112006
An achievable region for the Gaussian wiretap channel with side information · IEEE Trans. Inf. Theory 2006
Cryptographic primitives and cryptanalysis › information-theoretic security
coset coding
0.112005
Some new characters on the wire-tap channel of type II · IEEE Trans. Inf. Theory 2005
Cryptographic primitives and cryptanalysis › information-theoretic security
wiretap channel
0.112005
Some new characters on the wire-tap channel of type II · IEEE Trans. Inf. Theory 2005
Coding theory › error-correcting codes › coding bounds
dimension/length profile
0.112005
Some new characters on the wire-tap channel of type II · IEEE Trans. Inf. Theory 2005
Coding theory
generalized hamming weights
0.112005
Some new characters on the wire-tap channel of type II · IEEE Trans. Inf. Theory 2005
Coding theory › generalized hamming weights
relative generalized hamming weight
0.112005
Some new characters on the wire-tap channel of type II · IEEE Trans. Inf. Theory 2005
Coding theory › channel coding › channels with side information
dirty paper coding
0.012006
An achievable region for the Gaussian wiretap channel with side information · IEEE Trans. Inf. Theory 2006

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

equivocation analysis · 0.1coset coding · 0.1coding strategy · 0.1achievable rate-equivocation region · 0.1
YearPublicationVenuePosition
2006 An achievable region for the Gaussian wiretap channel with side information
abstract
In this correspondence, we extend the Gaussian wiretap channel model introduced by Leung-Yan-Cheong and Hellman to the Gaussian wiretap channel with side information by introducing additive white Gaussian interference in the main channel, which is available to the encoder in advance. This model is also an extension of the dirty-paper channel introduced by Costa since its main channel is the dirty-paper channel. A perfect-secrecy-achieving coding strategy for the model is proposed. It is used to derive achievable rates with asymptotic perfect secrecy and an achievable rate-equivocation region. The achievable rates with asymptotic perfect-secrecy are then compared to upper and lower bounds. The comparison indicates that the proposed coding strategy is optimal in some cases.
Chaichana Mitrpant, A. J. Han Vinck, Luo Yuan
IEEE Trans. Inf. Theory1
2005 Some new characters on the wire-tap channel of type II
abstract
The noiseless wire-tap channel of type II with coset coding scheme was provided by Ozarow and Wyner. In this correspondence, the user is split into multiple parties who are coordinated in coding their data symbols by using the same encoder. The adversary can tap not only partial transmitted symbols but also partial data symbols. We are interested in the equivocation of the data symbols to this adversary who has more power than that of Ozarow and Wyner. The generalized Hamming weight of Wei and the dimension/length profile (DLP) of Forney are extended to two-code formats: relative generalized Hamming weight and relative dimension/length profile (RDLP). Upper and lower bounds of the new concepts are investigated. They are useful to design a perfect secrecy coding scheme for the coordinated multiparty model. Under a general secrecy standard, the coordinated model can provide a higher transmission rate than an uncoordinated (time-sharing) model.
Luo Yuan, Chaichana Mitrpant, A. J. Han Vinck, Kefei Chen
IEEE Trans. Inf. Theory2
2004 A generalization of MDS codes
abstract
An inverse relative dimension/length profile (IRDLP) of a pair of codes was introduced to describe the equivocation. In this paper, the maximum distance separable (MDS) code is extended to a two-code format: relative MDS pair. For a code and a subcode, the pair is called a relative MDS pair if its inverse relative dimension-length profile (IRDLP) reaches the generalized singleton bound. We consider properties and constructions of relative MDS pairs.
Yuan Luo 0003, Fang-Wei Fu 0001, Chaichana Mitrpant, A. J. Han Vinck
ISIT3
2004 Achieving the perfect secrecy for the Gaussian wiretap channel with side information
abstract
This paper extends the Gaussian wiretap channel (GWC) model introduced by Leung-Yan-Cheong and Hellman (1978) to the Gaussian wiretap channel with side information (GWCSI) by adding an additive white Gaussian interference in the main channel, which is available to the encoder in advance. It can also be looked at as an extension of the dirty-paper channel (DPC) introduced by Costa (1983). We propose a coding strategy achieving perfect secrecy for the extended channel, called Gaussian wiretap channel with side information. The corresponding achievable rates with asymptotic perfect secrecy are obtained and compared to known upper and lower bounds.
Chaichana Mitrpant, Yuan Luo 0003, A. J. Han Vinck
ISIT1