Yanling Chen
Research Subjects
Research Interests
Yanling Chen has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Onur Ozan Koyluoglu
Department of Electrical and Computer Engineering, The University of Arizona, Tucson, AZ, USA
5 shared publications - Adrianus Johannes Han Vinck
Institute of Digital Signal Processing, University of Duisburg-Essen, 47057 Duisburg, Germany
4 shared publications - Aydin Sezgin
Ruhr University Bochum
3 shared publications - Masahito Hayashi
School of Data Science, The Chinese University of Hong Kong, Shenzhen, Longgang District, Shenzhen 518172, People’s Republic of China
3 shared publications A. J. Han Vinck
Center for Telecommunications, University of Johannesburg, Johannesburg, South Africa
2 shared publications- Chao Qi
School of Computer and Software Engineering, Xihua University, Chengdu, China
1 shared publication
Latest Publications
- Open Access
- 14 August 2025
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 31 (9) , 877-899
Using Identification Codes in the Two-Party Privacy-Preserving Record Linkage (PPRL)
In this paper, we show the problem of two-party privacy-preserving record linkage (PPRL) can be seen as an identification problem in Information Theory. We propose to apply the identification codes that are designed for identification via channels to the problem of PPRL, due to their advantage in the performance analysis, especially on a quantitative evaluation of the privacy. Note that for the PPRL, linkage quality is typically evaluated experimentally, whilst for privacy, there are so far no commonly accepted privacy measures available that allow an objective evaluation. Our approach of identification code provides an objective evaluation on both linkage quality and privacy based on parameters of employed identification codes.
- 14 August 2025
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 31 (9) , 877-899
Open AccessUsing Identification Codes in the Two-Party Privacy-Preserving Record Linkage (PPRL)
In this paper, we show the problem of two-party privacy-preserving record linkage (PPRL) can be seen as an identification problem in Information Theory. We propose to apply the identification codes that are designed for identification via channels to the problem of PPRL, due to their advantage in the performance analysis, especially on a quantitative evaluation of the privacy. Note that for the PPRL, linkage quality is typically evaluated experimentally, whilst for privacy, there are so far no commonly accepted privacy measures available that allow an objective evaluation. Our approach of identification code provides an objective evaluation on both linkage quality and privacy based on parameters of employed identification codes.
- 26 March 2025
- Published by Springer Nature
- p. 195-221
One-Hot Encoding and Bloom Filter Encoding in the Context of Privacy Preserving Record Linkage (PPRL)
- 26 March 2025
- Published by Springer Nature
- p. 195-221
One-Hot Encoding and Bloom Filter Encoding in the Context of Privacy Preserving Record Linkage (PPRL)
- 26 March 2025
- Published by Springer Nature
- p. 243-273
Adaptive Coding for Two-Way Wiretap Channel Under Strong Secrecy
- 26 March 2025
- Published by Springer Nature
- p. 243-273
Adaptive Coding for Two-Way Wiretap Channel Under Strong Secrecy
- 15 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (7) , 4611-4633
Non-Adaptive Coding for Two-Way Wiretap Channel With or Without Cost Constraints
This paper studies the secrecy results for the two-way wiretap channel (TW-WC) with an external eavesdropper under a strong secrecy metric. Employing non-adaptive coding, we analyze the information leakage and the decoding error probability, and derive inner bounds on the secrecy capacity regions for the TW-WC under strong joint and individual secrecy constraints. For the TW-WC without cost constraint, both the secrecy and error exponents could be characterized by the conditional Rényi mutual information in a concise and compact form. And, some special cases secrecy capacity region and sum-rate capacity results are established, demonstrating that adaption is useless in some cases or the maximum sum-rate that could be achieved by non-adaptive coding. For the TW-WC with cost constraint, we consider the peak cost constraint and extend our secrecy results by using the constant composition codes. Accordingly, we characterize both the secrecy and error exponents by a modification of Rényi mutual information , which yields inner bounds on the secrecy capacity regions for the general discrete memoryless TW-WC with cost constraint. Our method works even when a pre-noisy processing is employed based on a conditional distribution in the encoder and can be easily extended to other multi-user communication scenarios.
- 15 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (7) , 4611-4633
Non-Adaptive Coding for Two-Way Wiretap Channel With or Without Cost Constraints
This paper studies the secrecy results for the two-way wiretap channel (TW-WC) with an external eavesdropper under a strong secrecy metric. Employing non-adaptive coding, we analyze the information leakage and the decoding error probability, and derive inner bounds on the secrecy capacity regions for the TW-WC under strong joint and individual secrecy constraints. For the TW-WC without cost constraint, both the secrecy and error exponents could be characterized by the conditional Rényi mutual information in a concise and compact form. And, some special cases secrecy capacity region and sum-rate capacity results are established, demonstrating that adaption is useless in some cases or the maximum sum-rate that could be achieved by non-adaptive coding. For the TW-WC with cost constraint, we consider the peak cost constraint and extend our secrecy results by using the constant composition codes. Accordingly, we characterize both the secrecy and error exponents by a modification of Rényi mutual information , which yields inner bounds on the secrecy capacity regions for the general discrete memoryless TW-WC with cost constraint. Our method works even when a pre-noisy processing is employed based on a conditional distribution in the encoder and can be easily extended to other multi-user communication scenarios.
- Open Access
Non-Adaptive Coding for Two-Way Wiretap Channel with or without Cost Constraints
This paper studies the secrecy results for the two-way wiretap channel (TW-WC) with an external eavesdropper under a strong secrecy metric. Employing non-adaptive coding, we analyze the information leakage and the decoding error probability, and derive inner bounds on the secrecy capacity regions for the TW-WC under strong joint and individual secrecy constraints. For the TW-WC without cost constraint, both the secrecy and error exponents could be characterized by the conditional Rényi mutual information in a concise and compact form. And, some special cases secrecy capacity region and sum-rate capacity results are established, demonstrating that adaption is useless in some cases or the maximum sum-rate that could be achieved by non-adaptive coding. For the TW-WC with cost constraint, we consider the peak cost constraint and extend our secrecy results by using the constant composition codes. Accordingly, we characterize both the secrecy and error exponents by a modification of Rényi mutual information, which yields inner bounds on the secrecy capacity regions for the general discrete memoryless TW-WC with cost constraint. Our method works even when a pre-noisy processing is employed based on a conditional distribution in the encoder and can be easily extended to other multi-user communication scenarios.
Open AccessNon-Adaptive Coding for Two-Way Wiretap Channel with or without Cost Constraints
This paper studies the secrecy results for the two-way wiretap channel (TW-WC) with an external eavesdropper under a strong secrecy metric. Employing non-adaptive coding, we analyze the information leakage and the decoding error probability, and derive inner bounds on the secrecy capacity regions for the TW-WC under strong joint and individual secrecy constraints. For the TW-WC without cost constraint, both the secrecy and error exponents could be characterized by the conditional Rényi mutual information in a concise and compact form. And, some special cases secrecy capacity region and sum-rate capacity results are established, demonstrating that adaption is useless in some cases or the maximum sum-rate that could be achieved by non-adaptive coding. For the TW-WC with cost constraint, we consider the peak cost constraint and extend our secrecy results by using the constant composition codes. Accordingly, we characterize both the secrecy and error exponents by a modification of Rényi mutual information, which yields inner bounds on the secrecy capacity regions for the general discrete memoryless TW-WC with cost constraint. Our method works even when a pre-noisy processing is employed based on a conditional distribution in the encoder and can be easily extended to other multi-user communication scenarios.
- Open Access
- 1 January 2021
- Published by Computer Network Information Center, Chinese Academy of Sciences in China Scientific Data
- Vol. 6 (1)
A dataset of building instances of typical cities in China
Building contour information is an important part of the national basic geographic information. The performance of building automatic extraction is usually driven by a large number of training samples. To enrich the building extraction datasets of cities in China, we compiled a building instance dataset sourced from high-resolution remote sensing images through the combination of manual annotation and interactive annotation. This dataset consists of the samples in 7,260 regions, with 63,886 building instances in four China’s cities: Beijing, Shanghai, Shenzhen and Wuhan. The annotations of the dataset consist of MS COCO 2017 format files and the corresponding building mask binary maps. This dataset provides fundamental data for the research on building detection of and extraction from high-resolution remote sensing images.
- 1 January 2021
- Published by Computer Network Information Center, Chinese Academy of Sciences in China Scientific Data
- Vol. 6 (1)
Open AccessA dataset of building instances of typical cities in China
Building contour information is an important part of the national basic geographic information. The performance of building automatic extraction is usually driven by a large number of training samples. To enrich the building extraction datasets of cities in China, we compiled a building instance dataset sourced from high-resolution remote sensing images through the combination of manual annotation and interactive annotation. This dataset consists of the samples in 7,260 regions, with 63,886 building instances in four China’s cities: Beijing, Shanghai, Shenzhen and Wuhan. The annotations of the dataset consist of MS COCO 2017 format files and the corresponding building mask binary maps. This dataset provides fundamental data for the research on building detection of and extraction from high-resolution remote sensing images.
- Open Access
- 16 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 96984-97000
An Information-Theoretic Approach to the Chipless RFID Tag Identification
In this paper, we focus on the chipless radio-frequency identification (RFID), where the tag information bits are encoded by the peak/notch pattern appeared in the frequency spectrum of the radar cross section (RCS) of the tag. In particular, we restrict our attention to a simple yet prevalent “binary” coding method, where a bit 0 or bit 1 is encoded by the absence or presence of the peak/notch, respectively. We provide an information-theoretic framework for the tag identification based on such a binary coding method. Our aim is to accommodate more bits in the limited bandwidth without degrading the identification performance. To this end, we first formulate the detection of each bit as a binary asymmetric channel (where a signal processing approach is integrated into each interrogation to enhance the underlying channel quality). Moreover, it is proposed to perform multiple interrogations with majority rule-based detection (in correspondence to the signal processing approach in each interrogation). Furthermore, we introduce some error-detecting codes to further improve the performance of tag identification. For instance, motivated by the asymmetric property of the channel model, we propose to apply the constant weight code and the Berger-Freiman code (as two representatives of non-systematic and systematic codes, respectively) to the problem to be addressed in this paper. In addition, an investigation is also conducted into the cyclic redundancy check (CRC) codes (as a representative of those codes that are not dedicated to the binary asymmetric channel but could be potentially competitive for error detection). The system's performance is analyzed through the key parameters, namely the successful transmission rate, the false identification rate (i.e., the probability of undetected errors), and the expected number of retransmissions/interrogations. The effectiveness of the proposed methods is demonstrated by the numerical results.
- 16 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 96984-97000
Open AccessAn Information-Theoretic Approach to the Chipless RFID Tag Identification
In this paper, we focus on the chipless radio-frequency identification (RFID), where the tag information bits are encoded by the peak/notch pattern appeared in the frequency spectrum of the radar cross section (RCS) of the tag. In particular, we restrict our attention to a simple yet prevalent “binary” coding method, where a bit 0 or bit 1 is encoded by the absence or presence of the peak/notch, respectively. We provide an information-theoretic framework for the tag identification based on such a binary coding method. Our aim is to accommodate more bits in the limited bandwidth without degrading the identification performance. To this end, we first formulate the detection of each bit as a binary asymmetric channel (where a signal processing approach is integrated into each interrogation to enhance the underlying channel quality). Moreover, it is proposed to perform multiple interrogations with majority rule-based detection (in correspondence to the signal processing approach in each interrogation). Furthermore, we introduce some error-detecting codes to further improve the performance of tag identification. For instance, motivated by the asymmetric property of the channel model, we propose to apply the constant weight code and the Berger-Freiman code (as two representatives of non-systematic and systematic codes, respectively) to the problem to be addressed in this paper. In addition, an investigation is also conducted into the cyclic redundancy check (CRC) codes (as a representative of those codes that are not dedicated to the binary asymmetric channel but could be potentially competitive for error detection). The system's performance is analyzed through the key parameters, namely the successful transmission rate, the false identification rate (i.e., the probability of undetected errors), and the expected number of retransmissions/interrogations. The effectiveness of the proposed methods is demonstrated by the numerical results.
- 19 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Radio Frequency Identification
- Vol. 2 (4) , 170-184
On the Coding of Chipless Tags
It is believed that chipless tags, often printable, will play a fundamental role for RFID technology to replace the currently widely used barcode technology. An application scenario of chipless tags that raises concerns is that the object attached with a chipless tag can be bent and even folded or crumbled. In this case, it is very difficult to identify the tag identity (ID) since some peaks or notches, which reflect the information encoded in the tag ID, in the radar cross section of the tag may disappear. In this paper, we propose to insert some error-correcting bits to the code of tag ID to improve the reliability of identifying chipless tag IDs. An error-detection channel model for dealing with this problem is developed. It is found that the channel model is asymmetric. Several error-correcting codes, namely Golay, BCH, and majority-rule-based multiple interrogations, are proposed to apply to the chipless tag encoding/decoding problem. Some performance indices of these codes, namely successful reading rate and expected successful interrogation times, are analyzed. The asymmetric property of the channel model entails the performance analysis to be conducted in a different way from the literature. Numerical and simulation results are presented to show the effectiveness of the proposed methods.
- 19 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Radio Frequency Identification
- Vol. 2 (4) , 170-184
On the Coding of Chipless Tags
It is believed that chipless tags, often printable, will play a fundamental role for RFID technology to replace the currently widely used barcode technology. An application scenario of chipless tags that raises concerns is that the object attached with a chipless tag can be bent and even folded or crumbled. In this case, it is very difficult to identify the tag identity (ID) since some peaks or notches, which reflect the information encoded in the tag ID, in the radar cross section of the tag may disappear. In this paper, we propose to insert some error-correcting bits to the code of tag ID to improve the reliability of identifying chipless tag IDs. An error-detection channel model for dealing with this problem is developed. It is found that the channel model is asymmetric. Several error-correcting codes, namely Golay, BCH, and majority-rule-based multiple interrogations, are proposed to apply to the chipless tag encoding/decoding problem. Some performance indices of these codes, namely successful reading rate and expected successful interrogation times, are analyzed. The asymmetric property of the channel model entails the performance analysis to be conducted in a different way from the literature. Numerical and simulation results are presented to show the effectiveness of the proposed methods.
- 21 March 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 13 (9) , 2279-2293
Collective Secrecy Over the $K$ -Transmitter Multiple Access ChannelThis paper studies the problem of secure communication over a K-transmitter multiple access channel (MAC) in the presence of an external eavesdropper, subject to a collective secrecy constraint (i.e., information leakage rate to an eavesdropper on a collection of messages that are from a pre-specified subset of the K transmitters, say S ⊆ K = {1, 2, ..., K}, is made vanishing). Since secrecy is of concern only to transmitters {i|i ∈ S} but not to transmitters {i|i ∈ Sc}, where Sc = K/S, different transmission strategies could be employed at transmitters {i|i ∈ Sc}. Consider the following two scenarios: 1) transmitters {i|i ∈ Sc} use deterministic encoders (which are conventionally used for MAC without secrecy), competing for the channel resource (i.e., being competitive); 2) transmitters {i|i ∈ Sc} use stochastic encoders, helping to hide other transmitters’ messages from the eavesdropper (i.e., being cooperative). As a result, we establish the respective S-collective secrecy achievable rate regions and demonstrate the advantage of being cooperative theoretically and numerically. To this end, in addition to the standard techniques, our results build upon two techniques. The first is a generalization of Chia-El Gamal’s lemma on entropy bound for a set of codewords given partial information. The second is to utilize a compact representation of a list of sets that, together with submodular properties of mutual information functions involved, leads to an efficient Fourier-Motzkin elimination. These two approaches allow to derive achievable regions in this work, and could also be of independent interest in other context.
- 21 March 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 13 (9) , 2279-2293
Collective Secrecy Over the $K$ -Transmitter Multiple Access ChannelThis paper studies the problem of secure communication over a K-transmitter multiple access channel (MAC) in the presence of an external eavesdropper, subject to a collective secrecy constraint (i.e., information leakage rate to an eavesdropper on a collection of messages that are from a pre-specified subset of the K transmitters, say S ⊆ K = {1, 2, ..., K}, is made vanishing). Since secrecy is of concern only to transmitters {i|i ∈ S} but not to transmitters {i|i ∈ Sc}, where Sc = K/S, different transmission strategies could be employed at transmitters {i|i ∈ Sc}. Consider the following two scenarios: 1) transmitters {i|i ∈ Sc} use deterministic encoders (which are conventionally used for MAC without secrecy), competing for the channel resource (i.e., being competitive); 2) transmitters {i|i ∈ Sc} use stochastic encoders, helping to hide other transmitters’ messages from the eavesdropper (i.e., being cooperative). As a result, we establish the respective S-collective secrecy achievable rate regions and demonstrate the advantage of being cooperative theoretically and numerically. To this end, in addition to the standard techniques, our results build upon two techniques. The first is a generalization of Chia-El Gamal’s lemma on entropy bound for a set of codewords given partial information. The second is to utilize a compact representation of a list of sets that, together with submodular properties of mutual information functions involved, leads to an efficient Fourier-Motzkin elimination. These two approaches allow to derive achievable regions in this work, and could also be of independent interest in other context.
- Open Access
Effects of Feedback on the One-sided Secrecy of Two-way Wiretap through Multiple Transmissions
In this paper, the one-sided secrecy of two-way wiretap channel with feedback is investigated, where the confidential messages of one user through multiple transmissions is guaranteed secure against an external eavesdropper. For one thing, one-sided secrecy satisfies the secure demand of many practical scenarios. For another, the secrecy is measured over many blocks since the correlation between eavesdropper's observation and the confidential messages in successive blocks, instead of secrecy measurement of one block in previous works. Thus, firstly, an achievable secrecy rate region is derived for the general two-way wiretap channel with feedback through multiple transmissions under one-sided secrecy. Secondly, outer bounds on the secrecy capacity region are also obtained. The gap between inner and outer bounds on the secrecy capacity region is explored via the binary input two-way wiretap channels. Most notably, the secrecy capacity regions are established for the XOR channel. Furthermore, the result shows that the achievable rate region with feedback is larger than that without feedback. Therefore, the benefit role of feedback is precisely characterized for two-way wiretap channel with feedback under one-sided secrecy.
Open AccessEffects of Feedback on the One-sided Secrecy of Two-way Wiretap through Multiple Transmissions
In this paper, the one-sided secrecy of two-way wiretap channel with feedback is investigated, where the confidential messages of one user through multiple transmissions is guaranteed secure against an external eavesdropper. For one thing, one-sided secrecy satisfies the secure demand of many practical scenarios. For another, the secrecy is measured over many blocks since the correlation between eavesdropper's observation and the confidential messages in successive blocks, instead of secrecy measurement of one block in previous works. Thus, firstly, an achievable secrecy rate region is derived for the general two-way wiretap channel with feedback through multiple transmissions under one-sided secrecy. Secondly, outer bounds on the secrecy capacity region are also obtained. The gap between inner and outer bounds on the secrecy capacity region is explored via the binary input two-way wiretap channels. Most notably, the secrecy capacity regions are established for the XOR channel. Furthermore, the result shows that the achievable rate region with feedback is larger than that without feedback. Therefore, the benefit role of feedback is precisely characterized for two-way wiretap channel with feedback under one-sided secrecy.