Yuansheng Tang

According to our database1, Yuansheng Tang authored at least 19 papers between 1999 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Girth of the algebraic bipartite graph <i>D</i>(<i>k</i>,<i>q</i>).
Finite Fields Their Appl., December, 2023

On the girth cycles of the bipartite graph <i>D</i>(<i>k</i>,<i>q</i>).
Discret. Math., September, 2023

2021
On the characterization of some algebraically defined bipartite graphs of girth eight.
Discret. Appl. Math., 2021

2017
On cross-correlation of a binary m-sequence of period 2<sup>2k</sup>-1 and its decimated sequences by (2<sup>lk</sup>+1)/(2<sup>l</sup>+1).
Adv. Math. Commun., 2017

A new nonbinary sequence family with low correlation and large size.
Adv. Math. Commun., 2017

2016
On the conjecture for the girth of the bipartite graph D(k, q).
Discret. Math., 2016

2015
Exponential Sums From Half Quadratic Forms and Their Applications.
IEEE Trans. Inf. Theory, 2015

The cross correlation distribution of a p-ary m-sequence of period p<sup>m</sup>-1 and its decimated sequences by (p<sup>k</sup>+1)(p<sup>m</sup>+1)/4.
Finite Fields Their Appl., 2015

Some new results on cross correlation of p-ary m-sequence and its decimated sequence.
Adv. Math. Commun., 2015

2014
On the girth of the bipartite graph D(k, q).
Discret. Math., 2014

Exponential sum from half quadratic forms and its application.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2010
Cyclic codes and sequences: the generalized Kasami case.
IEEE Trans. Inf. Theory, 2010

2009
A Note on Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding.
IEEE Trans. Inf. Theory, 2009

Exponential Sums, Cyclic Codes and Sequences: the Odd Characteristic Kasami Case
CoRR, 2009

On the weight distribution of a class of cyclic codes.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2006
On the reliability-order-based decoding algorithms for binary linear block codes.
IEEE Trans. Inf. Theory, 2006

2004
On Viterbi-like algorithms and their application to Reed-Muller codes.
J. Complex., 2004

2002
Asymptotic optimality of the GMD and chase decoding algorithms.
IEEE Trans. Inf. Theory, 2002

1999
An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity.
Proceedings of the Applied Algebra, 1999


  Loading...