Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Lin, Liren"'
Publikováno v:
In Discrete Mathematics January 2025 348(1)
Autor:
Fan, Yun, Lin, Liren
This is a manuscript of a chapter prepared for a book. The good codes possess large information length and large minimum distance. A class of codes is said to be asymptotically good if there exists a positive real $\delta$ such that, for any positive
Externí odkaz:
http://arxiv.org/abs/2203.00958
Autor:
Lin, Liren, Chen, Chih-Wei
We provide a new interpretation of Hessian locally linear embedding (HLLE), revealing that it is essentially a variant way to implement the same idea of locally linear embedding (LLE). Based on the new interpretation, a substantial simplification can
Externí odkaz:
http://arxiv.org/abs/2112.09086
Autor:
Lin, Liren
We demonstrate that locally linear embedding (LLE) inherently admits some unwanted results when no regularization is used, even for cases in which regularization is not supposed to be needed in the original algorithm. The existence of one special typ
Externí odkaz:
http://arxiv.org/abs/2108.12680
Autor:
Lin, Liren, Fan, Yun
A kind of self-dual quasi-abelian codes of index $2$ over any finite field $F$ is introduced. By counting the number of such codes and the number of the codes of this kind whose relative minimum weights are small, such codes are proved to be asymptot
Externí odkaz:
http://arxiv.org/abs/2108.07427
Publikováno v:
In Finite Fields and Their Applications February 2024 94
Autor:
Fan, Yun, Lin, Liren
Bazzi and Mitter [3] showed that binary dihedral group codes are asymptotically good. In this paper we prove that the dihedral group codes over any finite field with good mathematical properties are asymptotically good. If the characteristic of the f
Externí odkaz:
http://arxiv.org/abs/2001.09402
Autor:
Liu, Jingge, Lin, Liren
Publikováno v:
In Finite Fields and Their Applications June 2023 88
Symbol-pair codes introduced by Cassuto and Blaum (2010) are designed to protect against pair errors in symbol-pair read channels. The higher the minimum pair distance, the more pair errors the code can correct. MDS symbol-pair codes are optimal in t
Externí odkaz:
http://arxiv.org/abs/1605.03460
The study of frequency-hopping sequences (FHSs) has been focused on the establishment of theoretical bounds for the parameters of FHSs as well as on the construction of optimal FHSs with respect to the bounds. Peng and Fan (2004) derived two lower bo
Externí odkaz:
http://arxiv.org/abs/1605.03454