Yunghsiang S. Han
YOU?
Author Swipe
View article: The Construction of Near-optimal Universal Coding of Integers
The Construction of Near-optimal Universal Coding of Integers Open
Universal Coding of Integers (UCI) is suitable for discrete memoryless sources with unknown probability distributions and infinitely countable alphabet sizes. The UCI is a class of prefix codes, such that the ratio of the average codeword …
View article: DeepRAG: Integrating Hierarchical Reasoning and Process Supervision for Biomedical Multi-Hop QA
DeepRAG: Integrating Hierarchical Reasoning and Process Supervision for Biomedical Multi-Hop QA Open
We propose DeepRAG, a novel framework that integrates DeepSeek hierarchical question decomposition capabilities with RAG Gym unified retrieval-augmented generation optimization using process level supervision. Targeting the challenging Med…
View article: A Fast Decoding Algorithm for Generalized Reed-Solomon Codes and Alternant Codes
A Fast Decoding Algorithm for Generalized Reed-Solomon Codes and Alternant Codes Open
In this paper, it is shown that the syndromes of generalized Reed-Solomon (GRS) codes and alternant codes can be characterized in terms of inverse fast Fourier transform, regardless of code definitions. Then a fast decoding algorithm is pr…
View article: An Intelligent Monitoring System for Sports Mental Health Status based on Big Data
An Intelligent Monitoring System for Sports Mental Health Status based on Big Data Open
This provides an effective way to break away from traditional inefficient evaluation methods for monitoring and analyzing the psychological status of a large number of school sports athletes, the author proposes an intelligent monitoring s…
View article: RIFi: Robust and iterative indoor localization based on Wi-Fi RSS fingerprints
RIFi: Robust and iterative indoor localization based on Wi-Fi RSS fingerprints Open
RSS fingerprint based indoor localization consists of two phases: offline phase and online phase. A RSS fingerprint database constructed at the offline phase may be outdated for online phase, which may significantly degrade the localizatio…
View article: I Was Diagnosed, but There Was Nothing: A Parkinson’s Patient’s Perspective on the Reality of Korea
I Was Diagnosed, but There Was Nothing: A Parkinson’s Patient’s Perspective on the Reality of Korea Open
From the perspective of a Parkinson's patient, this paper aims to elucidate some of the unreasonable and difficult-to-understand realities in Korea, from diagnosis to treatment, with a view to improving the system and policies. Adequate pr…
View article: Variant Codes Based on A Special Polynomial Ring and Their Fast Computations
Variant Codes Based on A Special Polynomial Ring and Their Fast Computations Open
Binary array codes are widely used in storage systems to prevent data loss, such as the Redundant Array of Independent Disks~(RAID). Most designs for such codes, such as Blaum-Roth~(BR) codes and Independent-Parity~(IP) codes, are carried …
View article: A Complete Proof of an Important Theorem for Variable-to-Variable Length Codes
A Complete Proof of an Important Theorem for Variable-to-Variable Length Codes Open
Variable-to-variable length (VV) codes are a class of lossless source coding. As their name implies, VV codes encode a variable-length sequence of source symbols into a variable-length codeword. This paper will give a complete proof of an …
View article: MDS Array Codes With Small Sub-packetization Levels and Small Repair Degrees
MDS Array Codes With Small Sub-packetization Levels and Small Repair Degrees Open
High-rate minimum storage regenerating (MSR) codes are known to require a large sub-packetization level, which can make meta-data management difficult and hinder implementation in practical systems. A few maximum distance separable (MDS) a…
View article: Distributed Quantized Detection of Sparse Signals Under Byzantine Attacks
Distributed Quantized Detection of Sparse Signals Under Byzantine Attacks Open
This paper investigates distributed detection of sparse stochastic signals with quantized measurements under Byzantine attacks. Under this type of attack, sensors in the networks might send falsified data to degrade system performance. The…
View article: MDS Array Codes With (Near) Optimal Repair Bandwidth for All Admissible Repair Degrees
MDS Array Codes With (Near) Optimal Repair Bandwidth for All Admissible Repair Degrees Open
Abundant high-rate (n, k) minimum storage regenerating (MSR) codes have been reported in the literature. However, most of them require contacting all the surviving nodes during a node repair process, resulting in a repair degree of d=n-1. …
View article: Human-machine Hierarchical Networks for Decision Making under Byzantine Attacks
Human-machine Hierarchical Networks for Decision Making under Byzantine Attacks Open
This paper proposes a belief-updating scheme in a human-machine collaborative decision-making network to combat Byzantine attacks. A hierarchical framework is used to realize the network where local decisions from physical sensors act as r…
View article: PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access
PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access Open
Partial maximum distance separable (PMDS) codes are a kind of erasure codes\nwhere the nodes are divided into multiple groups with each forming an MDS code\nwith a smaller code length, thus they allow repairing a failed node with only a\nf…
View article: New Decoding of Reed-Solomon Codes Based on FFT and Modular Approach
New Decoding of Reed-Solomon Codes Based on FFT and Modular Approach Open
Decoding algorithms for Reed--Solomon (RS) codes are of great interest for both practical and theoretical reasons. In this paper, an efficient algorithm, called the modular approach (MA), is devised for solving the Welch--Berlekamp (WB) ke…
View article: Efficient Ordered-Transmission Based Distributed Detection under Data Falsification Attacks
Efficient Ordered-Transmission Based Distributed Detection under Data Falsification Attacks Open
In distributed detection systems, energy-efficient ordered transmission (EEOT) schemes are able to reduce the number of transmissions required to make a final decision. In this work, we investigate the effect of data falsification attacks …
View article: The Story of $1/e$: ALOHA-based and Reinforcement-Learning-based Random Access for Delay-Constrained Communications
The Story of $1/e$: ALOHA-based and Reinforcement-Learning-based Random Access for Delay-Constrained Communications Open
Motivated by the proliferation of real-time applications in multimedia communication systems, tactile Internet, and cyber-physical systems, supporting delay-constrained traffic becomes critical for such systems. In delay-constrained traffi…
View article: Two New Piggybacking Designs with Lower Repair Bandwidth
Two New Piggybacking Designs with Lower Repair Bandwidth Open
Piggybacking codes are a special class of MDS array codes that can achieve small repair bandwidth with small sub-packetization by first creating some instances of an $(n,k)$ MDS code, such as a Reed-Solomon (RS) code, and then designing th…
View article: Reinforcement Learning for Improved Random Access in Delay-Constrained Heterogeneous Wireless Networks
Reinforcement Learning for Improved Random Access in Delay-Constrained Heterogeneous Wireless Networks Open
In this paper, we for the first time investigate the random access problem for a delay-constrained heterogeneous wireless network. We begin with a simple two-device problem where two devices deliver delay-constrained traffic to an access p…
View article: Generalized Universal Coding of Integers
Generalized Universal Coding of Integers Open
Universal coding of integers~(UCI) is a class of variable-length code, such that the ratio of the expected codeword length to $\max\{1,H(P)\}$ is within a constant factor, where $H(P)$ is the Shannon entropy of the decreasing probability d…
View article: Reputation and Audit Bit Based Distributed Detection in the Presence of Byzantine
Reputation and Audit Bit Based Distributed Detection in the Presence of Byzantine Open
In this paper, two reputation based algorithms called Reputation and audit based clustering (RAC) algorithm and Reputation and audit based clustering with auxiliary anchor node (RACA) algorithm are proposed to defend against Byzantine atta…
View article: A Generalization of Array Codes with Local Properties and Efficient Encoding/Decoding
A Generalization of Array Codes with Local Properties and Efficient Encoding/Decoding Open
A maximum distance separable (MDS) array code is composed of $m\times (k+r)$ arrays such that any $k$ out of $k+r$ columns suffice to retrieve all the information symbols. Expanded-Blaum-Roth (EBR) codes and Expanded-Independent-Parity (EI…
View article: Enhanced Audit Bit Based Distributed Bayesian Detection in the Presence of Strategic Attacks
Enhanced Audit Bit Based Distributed Bayesian Detection in the Presence of Strategic Attacks Open
This paper employs an audit bit based mechanism to mitigate the effect of Byzantine attacks. In this framework, the optimal attacking strategy for intelligent attackers is investigated for the traditional audit bit based scheme (TAS) to ev…
View article: Reinforcement Learning Random Access for Delay-Constrained Heterogeneous Wireless Networks: A Two-User Case
Reinforcement Learning Random Access for Delay-Constrained Heterogeneous Wireless Networks: A Two-User Case Open
In this paper, we investigate the random access problem for a delay-constrained heterogeneous wireless network. As a first attempt to study this new problem, we consider a network with two users who deliver delay-constrained traffic to an …
View article: Lower Bound on the Optimal Access Bandwidth of ($K+2,K,2$)-MDS Array Code with Degraded Read Friendly
Lower Bound on the Optimal Access Bandwidth of ($K+2,K,2$)-MDS Array Code with Degraded Read Friendly Open
Accessing the data in the failed disk (degraded read) with low latency is crucial for an erasure-coded storage system. In this work, the maximum distance separable (MDS) array code with the property of degraded-read friendly (DRF) is discu…
View article: Comparing Delay-Constrained ALOHA and CSMA: A Learning-Based Low-Complexity Approximate Approach
Comparing Delay-Constrained ALOHA and CSMA: A Learning-Based Low-Complexity Approximate Approach Open
Supporting delay-constrained traffic becomes more and more critical in multimedia communication systems, tactile Internet, networked control systems, and cyber-physical systems, etc. In delay-constrained traffic, each packet has a hard dea…
View article: Tightness of the Asymptotic Generalized Poor-Verdú Error Bound for the Memoryless Symmetric Channel.
Tightness of the Asymptotic Generalized Poor-Verdú Error Bound for the Memoryless Symmetric Channel. Open
The generalized Poor-Verdu error lower bound for multihypothesis testing is revisited. Its asymptotic expression is established in closed-form as its tilting parameter grows to infinity. The asymptotic generalized lower bound is then studi…
View article: Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel
Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel Open
The generalized Poor-Verdu error lower bound established in [1] for multihypothesis testing is studied in the classical channel coding context. It is proved that for any sequence of block codes sent over the memoryless binary symmetric cha…