97 citations · 108 across the 12 of their papers we have counts for
7 papers · 1 filter
Asymptotic Properties of Quasi-Group Codes
Yun Fan, Liren Lin
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 goo…
Self-dual -quasi-abelian Codes
Liren Lin, Yun Fan
A kind of self-dual quasi-abelian codes of index over any finite field is introduced. By counting the number of such codes and the number of the codes of this kind whose re…
Dihedral group codes over finite fields
Yun Fan, Liren Lin
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 mathemati…
Constacyclic symbol-pair codes: lower bounds and optimal constructions
Bocong Chen, Liren Lin, Hongwei Liu
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 pa…
Three new classes of optimal frequency-hopping sequence sets
Bocong Chen, Liren Lin, San Ling +1
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 FHS…
Thresholds of Random Quasi-Abelian Codes
Yun Fan, Liren Lin
For a random quasi-abelian code of rate , it is shown that the GV-bound is a threshold point: if is less than the GV-bound at , then the probability of the relative dista…
Constacyclic Codes over Finite Fields
Bocong Chen, Yun Fan, Liren Lin +1
An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length are…