28 citations · 79 across the 25 of their papers we have counts for
30 papers · 1 filter
Analog Error Correcting Codes with Constant Redundancy
Wentu Song, Kui Cai
We consider analog error-correcting codes (analog ECCs) that are designed to correct/detect outlying errors arising in analog implementations of vector-matrix multiplication. The e…
On the Sequence Reconstruction Problem for the Single-Deletion Two-Substitution Channel
Wentu Song, Kui Cai, Tony Q. S. Quek
The Levenshtein sequence reconstruction problem studies the reconstruction of a transmitted sequence from multiple erroneous copies of it. A fundamental question in this field is t…
Sequence Reconstruction for the Single-Deletion Single-Substitution Channel
Wentu Song, Kui Cai, Tony Q. S. Quek
The central problem in sequence reconstruction is to find the minimum number of distinct channel outputs required to uniquely reconstruct the transmitted sequence. According to Lev…
High Information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes
Yi Ding, Xuan He, Tuan Thanh Nguyen +6
DNA-based data storage has been attracting significant attention due to its extremely high data storage density, low power consumption, and long duration compared to conventional d…
New Construction of -ary Codes Correcting a Burst of at most Deletions
Wentu Song, Kui Cai, Tony Q. S. Quek
In this paper, for any fixed positive integers and , we construct -ary codes correcting a burst of at most deletions with redundancy $\log n+8\log\log n+o(\log\log…
Non-binary Two-Deletion Correcting Codes and Burst-Deletion Correcting Codes
Wentu Song, Kui Cai
In this paper, we construct systematic -ary two-deletion correcting codes and burst-deletion correcting codes, where is an even integer. For two-deletion codes, our co…
List-decodable Codes for Single-deletion Single-substitution with List-size Two
Wentu Song, Kui Cai, Tuan Thanh Nguyen
In this paper, we present an explicit construction of list-decodable codes for single-deletion and single-substitution with list size two and redundancy 3log n+4, where n is the bl…
Systematic Single-Deletion Multiple-Substitution Correcting Codes
Wentu Song, Nikita Polyanskii, Kui Cai +1
Recent work by Smagloy et al. (ISIT 2020) shows that the redundancy of a single-deletion -substitution correcting code is asymptotically at least , where…
Coded Caching with Polynomial Subpacketization
Wentu Song, Kui Cai, Long Shi
Consider a centralized caching network with a single server and users. The server has a database of files with each file being divided into packets ( is known as sub…
Some new Constructions of Coded Caching Schemes with Reduced Subpacketization
Wentu Song, Kui Cai, Long Shi
We study the problem of constructing centralized coded caching schemes with low subpacketization level based on the placement delivery array (PDA) design framework. PDA design is a…
Dynamic Programming for Sequential Deterministic Quantization of Discrete Memoryless Channels
Xuan He, Kui Cai, Wentu Song +1
In this paper, under a general cost function , we present a dynamic programming (DP) method to obtain an optimal sequential deterministic quantizer (SDQ) for -ary input discr…
Sequence-Subset Distance and Coding for Error Control in DNA-based Data Storage
Wentu Song, Kui Cai, Kees A. Schouhamer Immink
The process of DNA-based data storage (DNA storage for short) can be mathematically modelled as a communication channel, termed DNA storage channel, whose inputs and outputs are se…
Generalized Reed-Solomon Codes with Sparsest and Balanced Generator Matrices
Wentu Song, Kui Cai
We prove that for any positive integers and such that , there exists an generalized Reed-Solomon (GRS) code that has a sparsest and balanced…
On Sequential Locally Repairable Codes
Wentu Song, Kai Cai, Chau Yuen
We consider the locally repairable codes (LRC), aiming at sequential recovering multiple erasures. We define the (n,k,r,t)-SLRC (Sequential Locally Repairable Codes) as an [n,k] li…
Binary Locally Repairable Codes ---Sequential Repair for Multiple Erasures
Wentu Song, Chau Yuen
Locally repairable codes (LRC) for distribute storage allow two approaches to locally repair multiple failed nodes: 1) parallel approach, by which each newcomer access a set of …
Locally Repairable Codes with Functional Repair and Multiple Erasure Tolerance
Wentu Song, Chau Yuen
We consider the problem of designing [n; k] linear codes for distributed storage systems (DSS) that satisfy the (r, t)-Local Repair Property, where any t'(<=t) simultaneously faile…
Local Codes with Addition Based Repair
Han Mao Kiah, Son Hoang Dau, Wentu Song +1
We consider the complexities of repair algorithms for locally repairable codes and propose a class of codes that repair single node failures using addition operations only, or code…
Weakly Secure MDS Codes for Simple Multiple Access Networks
Son Hoang Dau, Wentu Song, Chau Yuen
We consider a simple multiple access network (SMAN), where sources of unit rates transmit their data to a common sink via relays. Each relay is connected to the sink and to…
Locally Encodable and Decodable Codes for Distributed Storage Systems
Son Hoang Dau, Han Mao Kiah, Wentu Song +1
We consider the locality of encoding and decoding operations in distributed storage systems (DSS), and propose a new class of codes, called locally encodable and decodable codes (L…
On the Solvability of 3s/nt Sum-Network---A Region Decomposition and Weak Decentralized Code Method
Wentu Song, Kai Cai, Chau Yuen +1
We study the network coding problem of sum-networks with 3 sources and n terminals (3s/nt sum-network), for an arbitrary positive integer n, and derive a sufficient and necessary c…
Erasure codes with symbol locality and group decodability for distributed storage
Wentu Song, Son Hoang Dau, Chau Yuen
We introduce a new family of erasure codes, called group decodable code (GDC), for distributed storage system. Given a set of design parameters {α; β; k; t}, where k is the number…
Secure Erasure Codes With Partial Decodability
Son Hoang Dau, Wentu Song, Chau Yuen
The MDS property (aka the -out-of- property) requires that if a file is split into several symbols and subsequently encoded into coded symbols, each being stored in one s…
Network Coding for st Sum-Networks
Wentu Song, Chau Yuen, Kai Cai +1
A sum-network is a directed acyclic network where each source independently generates one symbol from a given field and each terminal wants to receive the sum over $…
On the Existence of MDS Codes Over Small Fields With Constrained Generator Matrices
Son Hoang Dau, Wentu Song, Chau Yuen
We study the existence over small fields of Maximum Distance Separable (MDS) codes with generator matrices having specified supports (i.e. having specified locations of zero entrie…