arXiv subjects

Yubo Sun

Publications and source records attributed to Yubo Sun.

30 records · Page 2Linked to original sources

arXiv2025

Correcting Errors Through Partitioning and Burst-Deletion Correction

In this paper, we propose a partitioning technique that decomposes a pair of sequences with overlapping $t$-deletion $s$-substitution balls into sub-pairs, where the $^{\leq}t$-burst-deletion balls of each sub-pair intersect. This decomposition facilitates the development of $t$-deletion $s$-substitution correcting codes that leverage approaches from $^{\leq}t$-burst-deletion correction. Building upon established approaches in the $^{\leq}t$-burst-deletion correction domain, we construct $t$-deletion $s$-substitution correcting codes for $t\in \{1,2\}$ over binary alphabets and for $t=1$ in non-binary alphabets, with some constructions matching existing results and others outperforming current methods. Our framework offers new insights into the underlying principles of prior works, elucidates the limitations of current approaches, and provides a unified perspective on error correction strategies.

cs.IT↗

arXiv2025

On the Fixed-Length-Burst Levenshtein Ball with Unit Radius

Consider a length-$n$ sequence $\bm{x}$ over a $q$-ary alphabet. The \emph{fixed-length Levenshtein ball} $\mathcal{L}_t(\bm{x})$ of radius $t$ encompasses all length-$n$ $q$-ary sequences that can be derived from $\bm{x}$ by performing $t$ deletions followed by $t$ insertions. Analyzing the size and structure of these balls presents significant challenges in combinatorial coding theory. Recent studies have successfully characterized fixed-length Levenshtein balls in the context of a single deletion and a single insertion. These works have derived explicit formulas for various key metrics, including the exact size of the balls, extremal bounds (minimum and maximum sizes), as well as expected sizes and their concentration properties. However, the general case involving an arbitrary number of $t$ deletions and $t$ insertions $(t>1)$ remains largely uninvestigated. This work systematically examines fixed-length Levenshtein balls with multiple deletions and insertions, focusing specifically on \emph{fixed-length burst Levenshtein balls}, where deletions occur consecutively, as do insertions. We provide comprehensive solutions for explicit cardinality formulas, extremal bounds (minimum and maximum sizes), expected size, and concentration properties surrounding the expected value.

cs.IT↗

arXiv2025

Binary Reconstruction Codes for Correcting One Deletion and One Substitution

In this paper, we investigate binary reconstruction codes capable of correcting one deletion and one substitution. We define the \emph{single-deletion single-substitution ball} function $ \mathcal{B} $ as a mapping from a sequence to the set of sequences that can be derived from it by performing one deletion and one substitution. A binary \emph{$(n,N;\mathcal{B})$-reconstruction code} is defined as a collection of binary sequences of length $ n $ such that the intersection size between the single-deletion single-substitution balls of any two distinct codewords is strictly less than $ N $. This property ensures that each codeword can be uniquely reconstructed from $ N $ distinct elements in its single-deletion single-substitution ball. Our main contribution is to demonstrate that when $ N $ is set to $ 4n - 8 $, $ 3n - 4 $, $2n+9$, $ n+21 $, $31$, and $7$, the redundancy of binary $(n,N;\mathcal{B})$-reconstruction codes can be $0$, $1$, $2$, $ \log\log n + 3 $, $\log n + 1 $, and $ 3\log n + 4 $, respectively, where the logarithm is on base two.

cs.IT↗

arXiv2025

Sequence Reconstruction under Channels with Multiple Bursts of Insertions or Deletions

The sequence reconstruction problem involves a model where a sequence is transmitted over several identical channels. This model investigates the minimum number of channels required for the unique reconstruction of the transmitted sequence. Levenshtein established that this number exceeds the maximum size of the intersection between the error balls of any two distinct transmitted sequences by one. In this paper, we consider channels subject to multiple bursts of insertions and multiple bursts of deletions, respectively, where each burst has an exact length of value b. We provide a complete solution for the insertion case while partially addressing the deletion case.

cs.IT↗

arXiv2025

Asymptotically Optimal Codes for $(t,s)$-Burst Error

Recently, codes for correcting a burst of errors have attracted significant attention. One of the most important reasons is that bursts of errors occur in certain emerging techniques, such as DNA storage. In this paper, we investigate a type of error, called a $(t,s)$-burst, which deletes $t$ consecutive symbols and inserts $s$ arbitrary symbols at the same coordinate. Note that a $(t,s)$-burst error can be seen as a generalization of a burst of insertions ($t=0$), a burst of deletions ($s=0$), and a burst of substitutions ($t=s$). Our main contribution is to give explicit constructions of $q$-ary $(t,s)$-burst correcting codes with $\log n + O(1)$ bits of redundancy for any given constant non-negative integers $t$, $s$, and $q \geq 2$. These codes have optimal redundancy up to an additive constant. Furthermore, we apply our $(t,s)$-burst correcting codes to combat other various types of errors and improve the corresponding results. In particular, one of our byproducts is a permutation code capable of correcting a burst of $t$ stable deletions with $\log n + O(1)$ bits of redundancy, which is optimal up to an additive constant.

cs.IT↗

arXiv2024

Binary Codes for Correcting Two Edits

An edit refers to a single insertion, deletion, or substitution. This paper aims to construct binary codes that can correct two edits. To do this, a necessary and sufficient condition for a code to be two-edit correctable is provided, showing that a code is a two-edit correcting code if and only if it can correct two deletions, up to two substitutions, and one deletion and up to one substitution, separately. This criterion allows for the construction of two-edit correcting codes leveraging these three types of error correcting codes. In the field of constructing codes for correcting two deletions, we present a construction with $4\log n+O(\log\log n)$ redundant bits that can be viewed as a subcode proposed by Guruswami and Håstad, and provide an alternative proof. Moreover, our two-deletion correcting codes can also correct up to two substitutions after making a slight modification. In the field of constructing codes for correcting one deletion and up to one substitution, we present a construction with $4 \log n+O(\log\log n)$ redundant bits, which outperforms the best previously known results $6 \log n+O(1)$. Leveraging these codes, we obtain a construction of two-edit correcting codes with $6 \log n+O(\log\log n)$ redundant bits. This outperforms the best previously known result, which requires at least $8\log n$ redundant bits. Moreover, we also consider the list-decoding problem under the two-edit channel and construct a two-edit list-decodable code with a list size of two employing $4 \log n+O(\log\log n)$ redundant bits.

cs.IT↗

arXiv2024

Bounds and Constructions of $\ell$-Read Codes under the Hamming Metric

Nanopore sequencing is a promising technology for DNA sequencing. In this paper, we investigate a specific model of the nanopore sequencer, which takes a $q$-ary sequence of length $n$ as input and outputs a vector of length $n+\ell-1$ referred to as an $\ell$-read vector where the $i$-th entry is a multi-set composed of the $\ell$ elements located between the $(i-\ell+1)$-th and $i$-th positions of the input sequence. Considering the presence of substitution errors in the output vector, we study $\ell$-read codes under the Hamming metric. An $\ell$-read $(n,d)_q$-code is a set of $q$-ary sequences of length $n$ in which the Hamming distance between $\ell$-read vectors of any two distinct sequences is at least $d$. We first improve the result of Banerjee \emph{et al.}, who studied $\ell$-read $(n,d)_q$-codes with the constraint $\ell\geq 3$ and $d=3$. Then, we investigate the bounds and constructions of $2$-read codes with a minimum distance of $3$, $4$, and $5$, respectively. Our results indicate that when $d \in \{3,4\}$, the optimal redundancy of $2$-read $(n,d)_q$-codes is $o(\log_q n)$, while for $d=5$ it is $\log_q n+o(\log_q n)$. Additionally, we establish an equivalence between $2$-read $(n,3)_q$-codes and classical $q$-ary single-insertion reconstruction codes using two noisy reads. We improve the lower bound on the redundancy of classical $q$-ary single-insertion reconstruction codes as well as the upper bound on the redundancy of classical $q$-ary single-deletion reconstruction codes when using two noisy reads. Finally, we study $\ell$-read codes under the reconstruction model.

cs.IT↗

arXiv2023

Improved constructions of permutation and multi-permutation codes correcting a burst of stable deletions

Permutation codes and multi-permutation codes have been widely considered due to their various applications, especially in flash memory. In this paper, we consider permutation codes and multi-permutation codes against a burst of stable deletions. In particular, we propose a construction of permutation codes correcting a burst stable deletion of length $s$, with redundancy $\log n+ 2\log \log n+O(1)$. Compared to the previous known results, our improvement relies on a different strategy to retrieve the missing symbol on the first row of the array representation of a permutation. We also generalize our constructions for multi-permutations and the variable length burst model. Furthermore, we propose a linear-time encoder with optimal redundancy for single stable deletion correcting permutation codes.

cs.IT↗

arXiv2019

Passivity guaranteed stiffness control with multiple frequency band specifications for a cable-driven series elastic actuator

Impedance control and specifically stiffness control are widely applied for physical human-robot interaction. The series elastic actuator (SEA) provides inherent compliance, safety and further benefits. This paper aims to improve the stiffness control performance of a cable-driven SEA. Existing impedance controllers were designed within the full frequency domain, though human-robot interaction commonly falls in the low frequency range. We enhance the stiffness rendering performance under formulated constraints of passivity, actuator limitation, disturbance attenuation, noise rejection at their specific frequency ranges. Firstly, we reformulate this multiple frequency-band optimization problem into the $H_\infty$ synthesis framework. Then, the performance goals are quantitatively characterized by respective restricted frequency-domain specifications as norm bounds. Further, a structured controller is directly synthesized to satisfy all the competing performance requirements. Both simulation and experimental results showed that the produced controller enabled good interaction performance for each desired stiffness varying from 0 to 1 times of the physical spring constant. Compared with the passivity-based PID method, the proposed $H_\infty$ synthesis method achieved more accurate and robust stiffness control performance with guaranteed passivity.

cs.RO↗

arXiv2018

Tailoring Interdigitated Back Contacts for High-performance Bifacial Silicon Solar Cells

Photovoltaic (PV) cells have become one of the most promising renewable energy technologies. To make PV more competitive with incumbent technologies, higher power output densities are needed. One promising approach is to add bifaciality to existing monofacial PV devices, allowing more output power from the additional reflection of sunlight from the ground (albedo). For example, bifaciality can be added to Silicon Heterojunction (SHJ) solar cell with Interdigitated Back Contacts (IBC) by opening up the gaps between the back metal contacts, but the optimum gap that maximizes power output is unknown. In this paper we show that that the optimum gap that maximizes IBC SHJ bifacial power output, where is the ratio of output power density to power loss due to shadowing and Joule heating, The results are validated by self consistent finite element device modeling. For a typical albedo factor of 0.3, an optimized bifacial IBC SHJ cell will produce 17% more power output than state-of-the-art monofacial IBC SHJ cells. The results encourage development of bifacial IBC solar cells as a next generation PV technology.

physics.app-ph↗

arXiv2018

Real-time force control of an SEA-based body weight support unit with the 2-DOF control structure

Body weight support (BWS) is a fundamental technique in rehabilitation. Along with the dramatic progressing of rehabilitation science and engineering, BWS is quickly evolving with new initiatives and has attracted deep research effort in recent years. We have built up a novel gravity offloading system, in which the patient is allowed to move freely in the three-dimensional Cartesian space and receives support against gravity. Thus, the patients, especially for those that suffer from neurological injury such as stroke or spinal cord injury, can focus their residual motor control capabilities on essential therapeutic trainings of balance and gait. The real-time force control performance is critical for the BWS unit to provide suitable support and avoid disturbance. In this work, we have re-designed our BWS unit with a series elastic actuation structure to improve the human-robot interaction performance. Further, the 2 degrees of freedom (2-DOF) control approach was taken for accurate and robust BWS force control. Both simulation and experimental results have validated the efficacy of the BWS design and real-time control methods.

cs.RO↗

arXiv2018

Sesame: a 2-dimensional solar cell modeling tool

This work introduces a new software package `Sesame' for the numerical computation of classical semiconductor equations. It supports 1 and 2-dimensional systems and provides tools to easily implement extended defects such as grain boundaries or sample surfaces. Sesame has been designed to facilitate fast exploration of the system parameter space and to visualize local charge transport properties. Sesame is distributed as a Python package or as a standalone GUI application, and is available at https://pages.nist.gov/sesame/ .

physics.app-ph↗