Xubo Zhao

Orcid: 0000-0002-9405-9067

According to our database1, Xubo Zhao authored at least 14 papers between 2012 and 2022.

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

2022
Balanced Whiteman Generalized Cyclotomic Sequences with Maximal 2-adic Complexity.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022

On Hermitian LCD Generalized Gabidulin Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022

A Straight Construction Algorithm for a Delay Invariant Convolutional Network Coding on Cyclic Networks.
IEEE Access, 2022

2021
A family of Hermitian dual-containing constacyclic codes and related quantum codes.
Quantum Inf. Process., 2021

2020
Hermitian dual-containing constacyclic BCH codes and related quantum codes of length (q<sup>2m</sup>-1)/(q+1).
CoRR, 2020

Double Circulant Self-dual Codes on Sextic Cyclotomy.
CoRR, 2020

2017
An Improved Independence Test Method for the Convolutional Multicast Algorithm.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

A New Method for the Decoding Delay Distributions of Random Linear Coding Schemes.
IEEE Commun. Lett., 2017

2013
Scalar Linear Solvability of Matroidal Error Correction Network.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

The Explicit Decoding Delay Probability Distribution Based on Random Linear Coding Scheme.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Linear Complexity of a New Generalized Cyclotomic Sequence of Order Two of Length <i>pq</i>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Linear Complexity of Binary Whiteman Generalized Cyclotomic Sequences of Order 4.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

2012
Equivalent Conditions to Determine the GEKs by the LEKs in a Convolutional Network Code over a Cyclic Network.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

Notes on "Exact Decoding Probability Under Random Linear Network Coding".
IEEE Commun. Lett., 2012


  Loading...