5 papers
On the Number of Subsequences in the Nonbinary Deletion Channel
Han Li, Xiang Wang, Fang-Wei Fu
In the deletion channel, an important problem is to determine the number of subsequences derived from a string of length when subjected to deletions. It is well-known t…
Some New Results on Sequence Reconstruction Problem for Deletion Channels
Xiang Wang, Weijun Fang, Han Li +1
Levenshtein first introduced the sequence reconstruction problem in . In the realm of combinatorics, the sequence reconstruction problem is equivalent to determining the valu…
Sequence Reconstruction Problem for Ternary Deletion Channels
Xiang Wang, Han Li, Fang-Wei Fu
The sequence reconstruction problem was proposed by Levenshtein in 2001. In this model, a sequence from a code is transmitted over several channels, and the decoder receives the di…
Generalized bilateral multilevel construction for constant dimension codes from parallel mixed dimension construction
Han Li, Fang-Wei Fu
Constant dimension codes (CDCs), as special subspace codes, have received extensive attention due to their applications in random network coding. The basic problem of CDCs is to de…
New Constant Dimension Codes From the Inserting Mixed Dimension Construction and Multilevel Construction
Han Li, Fang-Wei Fu
Constant dimension codes (CDCs) are essential for error correction in random network coding. A fundamental problem of CDCs is to determine their maximal possible size for given par…